The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application

DOI10.1007/978-3-030-99277-4_3zbMath1547.94432MaRDI QIDQ6618581

Keita Xagawa

Publication date: 14 October 2024

zbMATH Keywords

anonymitypublic-key encryptionpost-quantum cryptographyselective-opening securitytag-based encryptionthe Boneh-Katz transformation

Mathematics Subject Classification ID

Cryptography (94A60)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Strongly secure authenticated key exchange from factoring, codes, and lattices
• One-round key exchange in the standard model
• Probabilistic encryption
• On the gold standard for security of universal steganography
• CCA2 key-privacy for code-based encryption in the standard model
• Hash proof systems over lattices revisited
• Bonsai trees, or how to delegate a lattice basis
• Two-round oblivious transfer from CDH or LPN
• Collision resistant hashing from sub-exponential learning parity with noise
• Worst-case hardness for LPN and cryptographic hashing via code smoothing
• Rate-1, Linear Time and Additively Homomorphic UC Commitments
• Cryptography with Auxiliary Input and Trapdoor from Constant-Noise LPN
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Simulation-Based Selective Opening CCA Security for PKE from Key Encapsulation Mechanisms
• A Formal Treatment of Backdoored Pseudorandom Generators
• On Invertible Sampling and Adaptive Security
• Collision-Free Hashing from Lattice Problems
• Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
• Efficient Lattice (H)IBE in the Standard Model
• Security and Anonymity of Identity-Based Encryption with Multiple Trusted Authorities
• A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
• IND-CCA Secure Cryptography Based on a Variant of the LPN Problem
• Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
• How to use indistinguishability obfuscation
• Advances in Cryptology - EUROCRYPT 2004
• Simple Chosen-Ciphertext Security from Low-Noise LPN
• Chosen‐Ciphertext Security from Identity‐Based Encryption
• Progress in Cryptology – Mycrypt 2005
• Topics in Cryptology – CT-RSA 2005
• Automata, Languages and Programming
• A Public-Key Encryption Scheme with Pseudo-random Ciphertexts
• Theory of Cryptography
• On lattices, learning with errors, random linear codes, and cryptography
• Theory of Cryptography
• CCA security and trapdoor functions via key-dependent-message security

This page was built for publication: The Boneh-Katz transformation, revisited: pseudorandom/obliviously-samplable PKE from lattices and codes and its application