Public Key Authenticated Encryption with Keyword Search from LWE

[1]  K. Emura.  Generic Construction of Public-key Authenticated Encryption with Keyword Search Revisited: Stronger Security and Efficient Construction , 2022, IACR Cryptol. ePrint Arch..

[2]  Raylin Tso,et al.  Public-key Authenticated Encryption with Keyword Search: Cryptanalysis, Enhanced Security, and Quantum-resistant Instantiation , 2022, IACR Cryptol. ePrint Arch..

[3]  Fei Meng,et al.  Security analysis of Pan et al.'s "Public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability" , 2021, J. Syst. Archit..

[4]  Raylin Tso,et al.  Public-Key Authenticated Encryption with Keyword Search: A Generic Construction and Its Quantum-Resistant Instantiation , 2021, Comput. J..

[5]  Fagen Li,et al.  Public-key authenticated encryption with keyword search achieving both multi-ciphertext and multi-trapdoor indistinguishability , 2021, J. Syst. Archit..

[6]  Attila A. Yavuz,et al.  Lattice-Based Public Key Searchable Encryption from Experimental Perspectives , 2020, IEEE Transactions on Dependable and Secure Computing.

[7]  Ximeng Liu,et al.  Public-key authenticated encryption with keyword search revisited: Security model and constructions , 2020, Inf. Sci..

[8]  Xiaojun Zhang,et al.  Lattice-based proxy-oriented identity-based encryption with keyword search for cloud storage , 2019, Inf. Sci..

[9]  Ziba Eslami,et al.  Public key authenticated encryption with keyword search: revisited , 2019, IET Inf. Secur..

[10]  Huaxiong Wang,et al.  FS-PEKS: Lattice-Based Forward Secure Public-Key Encryption with Keyword Search for Cloud-Assisted Industrial Internet of Things , 2019, IEEE Transactions on Dependable and Secure Computing.

[11]  Léo Ducas,et al.  Hash Proof Systems over Lattices Revisited , 2018, IACR Cryptol. ePrint Arch..

[12]  Qiong Huang,et al.  An efficient public-key searchable encryption scheme secure against inside keyword guessing attacks , 2017, Inf. Sci..

[13]  Chris Peikert,et al.  Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller , 2012, IACR Cryptol. ePrint Arch..

[14]  David Cash,et al.  Bonsai Trees, or How to Delegate a Lattice Basis , 2010, Journal of Cryptology.

[15]  Dan Boneh,et al.  Efficient Lattice (H)IBE in the Standard Model , 2010, EUROCRYPT.

[16]  David Cash,et al.  Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems , 2009, CRYPTO.

[17]  Chris Peikert,et al.  Generating Shorter Bases for Hard Random Lattices , 2009, Theory of Computing Systems.

[18]  Craig Gentry,et al.  Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..

[19]  Dong Hoon Lee,et al.  Off-Line Keyword Guessing Attacks on Recent Keyword Search Schemes over Encrypted Data , 2006, Secure Data Management.

[20]  Michael Mitzenmacher,et al.  Privacy Preserving Keyword Searches on Remote Encrypted Data , 2005, ACNS.

[21]  Oded Regev,et al.  On lattices, learning with errors, random linear codes, and cryptography , 2005, STOC '05.

[22]  Rafail Ostrovsky,et al.  Public Key Encryption with Keyword Search , 2004, EUROCRYPT.

[23]  Ronald Cramer,et al.  Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption , 2001, EUROCRYPT.

[24]  Miklós Ajtai,et al.  Generating Hard Instances of the Short Basis Problem , 1999, ICALP.

[25]  Peter W. Shor,et al.  Algorithms for quantum computation: discrete logarithms and factoring , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[26]  Baodong Qin,et al.  Improved Security Model for Public-Key Authenticated Encryption with Keyword Search , 2021, ProvSec.

[27]  Shafi Goldwasser,et al.  Complexity of lattice problems - a cryptographic perspective , 2002, The Kluwer international series in engineering and computer science.