Compact selective opening security from LWE
From MaRDI portal
Cites work
- A Framework for Efficient and Composable Oblivious Transfer
- Advances in Cryptology - EUROCRYPT 2004
- All-but-many encryption. A new framework for fully-equipped UC commitments
- All-but-many lossy trapdoor functions
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- All-but-many lossy trapdoor functions from lattices and applications
- Building lossy trapdoor functions from lossy encryption
- Chosen-ciphertext security from slightly lossy trapdoor functions
- Compact and tightly selective-opening secure public-key encryption schemes
- Compressible FHE with applications to PIR
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Encryption schemes secure against chosen-ciphertext selective opening attacks
- Extended-DDH and lossy trapdoor functions
- Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- scientific article; zbMATH DE number 1759794 (Why is no real title available?)
- Identity-based (lossy) trapdoor functions and applications
- Identity-based encryption secure against selective opening attack
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Key homomorphic PRFs and their applications
- Lattice-based FHE as secure as PKE
- Learning with rounding, revisited. New reduction, properties and applications
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy functions do not amplify well
- Lossy trapdoor functions and their applications
- Lossy trapdoor permutations with improved lossiness
- More constructions of lossy and correlation-secure trapdoor functions
- On definitions of selective opening security
- On lattices, learning with errors, random linear codes, and cryptography
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On the selective opening security of practical public-key encryption schemes
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key cryptosystems from the worst-case shortest vector problem
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Scientific computing. A historical perspective
- Selective opening security from simulatable data encapsulation
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Standard security does not imply indistinguishability under selective opening
- Standard security does not imply security against selective-opening
- Standard versus selective opening security: separation and equivalence results
- Trapdoor hash functions and their applications
- Trapdoors for lattices: simpler, tighter, faster, smaller
Cited in
(5)- Adaptive security in SNARGs via iO and lossy functions
- Fully selective opening secure IBE from LWE
- Generic constructions of compact and tightly selective-opening secure public-key encryption schemes
- Revisiting the robustness of (R/M)LWR under polynomial moduli with its applications
- Hierarchical identity-based encryption with receiver selective opening security in the multi-challenge setting
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)
