Titlebook: Information and Communications Security; 19th International C Sihan Qing,Chris Mitchell,Dongmei Liu Conference proceedings 2018 Springer Na

Fraudulent

Towards Tightly Secure Deterministic Public Key Encryption can be tightly PRIV-IND-.-CCA secure. Finally, we prove that the all-but-. TDF given by Hemenway et al. is tightly secure, which results in the first tightly PRIV-IND-.-CCA secure D-PKE scheme for block-sources, based on the .-DCR assumption.

ANIM

Formal Analysis of a TTP-Free Blacklistable Anonymous Credentials Systemolic model using applied pi calculus, which is suitable for automated reasoning via formal analysis tools. We model the definitions of some common security properties: authenticity, non-framebility, mis-authentication resistance and privacy (anonymity and unlinkability). The case study of these secu

harangue

colostrum

FABSS: Attribute-Based Sanitizable Signature for Flexible Access Structureir medical data frequently and have to sign these medical data from scratch after updating. Besides, traditional signature attests the identity of the individual signing the records, which leads to vast computation cost and the privacy leakage. In this paper, we obfuscate users identity information

多节

SSUKey: A CPU-Based Solution Protecting Private Keys on Untrusted OSecure private keys – some of them employ extra specific hardware devices while most of them adopt security features provided by general OS. However, users are reluctant to extra devices and general OS is too complicated to protect itself, let alone the private keys on it. This paper proposes a softw

缩影

The Reductions for the Approximating Covering Radius Problem-preserving reduction from approximating . to . (Covering Bounded Distance Decoding Problem). Furthermore, we show that there are polynomial-time reductions from . to approximating . (Closest Vector Problem) and . (Shortest Independent Vector Problem), respectively. Hence, . reduces to . and . under

AORTA

Distributed Pseudorandom Functions for General Access Structures in NP computation is distributed to multiple servers. Although by distributing the function computation, we avoid single points of failures, this distribution usually implies the need for multiple interactions with the parties (servers) involved in the computation of the function. In this paper, we take

伪书

Reducing Randomness Complexity of Mask Refreshing Algorithmxes), each basic operation of the function should be replaced with the .-th order secure operation. In this process, the multiplication with dependent inputs always exists, which may lead to security bias. In order to preserve the security of the dependent-input multiplication, a refreshing algorith

PAGAN

A Plausibly Deniable Encryption Scheme Utilizing PUF’s Thermo-Sensitivityr random parameters. However, current deniable encryption schemes or techniques either require the user to remember some tedious random parameters used in encryption or demand special designs in the file system. Any abnormality in the user’s behavior or in the file system tend to arouse suspicion, t

debris