Compact selective opening security from LWE
From MaRDI portal
Publication:6635895
DOI10.1007/978-3-031-57728-4_5MaRDI QIDQ6635895
Kristina Hostáková, Julia Kastner, Dennis Hofheinz, Karen Klein, Akın Ünal
Publication date: 12 November 2024
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- All-but-many lossy trapdoor functions from lattices and applications
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Compressible FHE with applications to PIR
- Lossy trapdoor permutations with improved lossiness
- Trapdoor hash functions and their applications
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Learning with Rounding, Revisited
- Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
- Key Homomorphic PRFs and Their Applications
- Building Lossy Trapdoor Functions from Lossy Encryption
- Lossy Functions Do Not Amplify Well
- All-But-Many Lossy Trapdoor Functions
- Identity-Based (Lossy) Trapdoor Functions and Applications
- Standard Security Does Not Imply Security against Selective-Opening
- Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
- On Definitions of Selective Opening Security
- Extended-DDH and Lossy Trapdoor Functions
- All-But-Many Encryption
- On the Selective Opening Security of Practical Public-Key Encryption Schemes
- Selective Opening Security from Simulatable Data Encapsulation
- Lattice-based FHE as secure as PKE
- Identity-Based Encryption Secure against Selective Opening Attack
- Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
- Standard Security Does Not Imply Indistinguishability Under Selective Opening
- Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Lossy trapdoor functions and their applications
- More Constructions of Lossy and Correlation-Secure Trapdoor Functions
- Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
- Encryption Schemes Secure against Chosen-Ciphertext Selective Opening Attacks
- Instantiability of RSA-OAEP under Chosen-Plaintext Attack
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- A Framework for Efficient and Composable Oblivious Transfer
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Scientific Computing
- Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited
- Public-key cryptosystems from the worst-case shortest vector problem
- Advances in Cryptology - EUROCRYPT 2004
- Standard versus Selective Opening Security: Separation and Equivalence Results
- On lattices, learning with errors, random linear codes, and cryptography
- Compact and tightly selective-opening secure public-key encryption schemes
Related Items (1)
This page was built for publication: Compact selective opening security from LWE
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6635895)
