SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
From MaRDI portal
(Redirected from Publication:831176)
Recommendations
- 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
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Public-key encryption with selective opening security from general assumptions
Cites work
- scientific article; zbMATH DE number 5009201 (Why is no real title available?)
- scientific article; zbMATH DE number 1088907 (Why is no real title available?)
- (Hierarchical) identity-based encryption from affine message authentication
- About the Security of MTI/C0 and MQV
- 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
- An algebraic framework for Diffie-Hellman assumptions
- Circular chosen-ciphertext security with compact ciphertexts
- Classical hardness of learning with errors
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- Efficient Identity-Based Encryption Without Random Oracles
- Efficient lattice (H)IBE in the standard model
- Encryption schemes secure against chosen-ciphertext selective opening attacks
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack
- Identity-based encryption secure against selective opening attack
- Identity-based encryption tightly secure under chosen-ciphertext attacks
- Lossy algebraic filters with short tags
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Lossy trapdoor functions and their applications
- Magic functions
- On definitions of selective opening security
- On lattices, learning with errors, random linear codes, and cryptography
- On the selective opening security of practical public-key encryption schemes
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Probabilistic encryption
- Programmable Hash Functions and Their Applications
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Selective Opening Security for Receivers
- Selective opening security from simulatable data encapsulation
- Selective-Opening Security in the Presence of Randomness Failures
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Shrinking the keys of discrete-log-type lossy trapdoor functions
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
- Simulation-based selective opening CCA security for PKE from key encapsulation mechanisms
- Simulation-based selective opening security for receivers under chosen-ciphertext attacks
- Standard security does not imply indistinguishability under selective opening
- Standard security does not imply security against selective-opening
- Theory of Cryptography
- Tightly SIM-SO-CCA secure public key encryption from standard assumptions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(6)- All-but-many lossy trapdoor functions from lattices and applications
- Simulation-based bi-selective opening security for public key encryption
- Receiver selective opening security for identity-based encryption in the multi-challenge setting
- All-but-many lossy trapdoor functions
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- CCA-security from adaptive all-but-one lossy trapdoor functions
This page was built for publication: SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831176)
