Elliptic Curve Cryptography; Applications, challenges, recent advances, and future trends: A comprehensive survey

S Ullah, J Zheng, N Din, MT Hussain, F Ullah… - Computer Science …, 2023 - Elsevier
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 …

Blockchain security: A survey of techniques and research directions

J Leng, M Zhou, JL Zhao, Y Huang… - IEEE Transactions on …, 2020 - ieeexplore.ieee.org
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 …

Privacy-preserving multi-keyword ranked search over encrypted cloud data

N Cao, C Wang, M Li, K Ren… - IEEE Transactions on …, 2013 - ieeexplore.ieee.org
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 …

Decentralizing attribute-based encryption

A Lewko, B Waters - Annual international conference on the theory and …, 2011 - Springer
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 …

Functional encryption: Definitions and challenges

D Boneh, A Sahai, B Waters - Theory of Cryptography: 8th Theory of …, 2011 - Springer
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 …

Predicate encryption supporting disjunctions, polynomial equations, and inner products

J Katz, A Sahai, B Waters - … 2008: 27th Annual International Conference on …, 2008 - Springer
Predicate encryption is a new paradigm generalizing, among other things, identity-based
encryption. In a predicate encryption scheme, secret keys correspond to predicates and …

Bonsai trees, or how to delegate a lattice basis

D Cash, D Hofheinz, E Kiltz, C Peikert - Journal of cryptology, 2012 - Springer
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 …

Deterministic and efficiently searchable encryption

M Bellare, A Boldyreva, A O'Neill - … , Santa Barbara, CA, USA, August 19 …, 2007 - Springer
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 …

Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions

M Abdalla, M Bellare, D Catalano, E Kiltz… - Advances in Cryptology …, 2005 - Springer
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 …

A survey of provably secure searchable encryption

C Bösch, P Hartel, W Jonker, A Peter - ACM Computing Surveys (CSUR), 2014 - dl.acm.org
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 …