Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive survey
Elliptic Curve (EC) is the most recent and advanced technique of Elliptic Curve
Cryptography (ECC). EC is often used to improve the security of open communication …
Cryptography (ECC). EC is often used to improve the security of open communication …
Blockchain security: A survey of techniques and research directions
Blockchain, an emerging paradigm of secure and shareable computing, is a systematic
integration of 1) chain structure for data verification and storage, 2) distributed consensus …
integration of 1) chain structure for data verification and storage, 2) distributed consensus …
Privacy-preserving multi-keyword ranked search over encrypted cloud data
With the advent of cloud computing, data owners are motivated to outsource their complex
data management systems from local sites to the commercial public cloud for great flexibility …
data management systems from local sites to the commercial public cloud for great flexibility …
Decentralizing attribute-based encryption
Abstract We propose a Multi-Authority Attribute-Based Encryption (ABE) system. In our
system, any party can become an authority and there is no requirement for any global …
system, any party can become an authority and there is no requirement for any global …
Functional encryption: Definitions and challenges
We initiate the formal study of functional encryption by giving precise definitions of the
concept and its security. Roughly speaking, functional encryption supports restricted secret …
concept and its security. Roughly speaking, functional encryption supports restricted secret …
Predicate encryption supporting disjunctions, polynomial equations, and inner products
Predicate encryption is a new paradigm generalizing, among other things, identity-based
encryption. In a predicate encryption scheme, secret keys correspond to predicates and …
encryption. In a predicate encryption scheme, secret keys correspond to predicates and …
Bonsai trees, or how to delegate a lattice basis
We introduce a new lattice-based cryptographic structure called a bonsai tree, and use it to
resolve some important open problems in the area. Applications of bonsai trees include an …
resolve some important open problems in the area. Applications of bonsai trees include an …
Deterministic and efficiently searchable encryption
We present as-strong-as-possible definitions of privacy, and constructions achieving them,
for public-key encryption schemes where the encryption algorithm is deterministic. We …
for public-key encryption schemes where the encryption algorithm is deterministic. We …
Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions
We identify and fill some gaps with regard to consistency (the extent to which false positives
are produced) for public-key encryption with keyword search (PEKS). We define …
are produced) for public-key encryption with keyword search (PEKS). We define …
A survey of provably secure searchable encryption
We survey the notion of provably secure searchable encryption (SE) by giving a complete
and comprehensive overview of the two main SE techniques: searchable symmetric …
and comprehensive overview of the two main SE techniques: searchable symmetric …