SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
From MaRDI portal
Publication:831176
DOI10.1007/S10623-021-00849-9zbMATH Open1462.94040OpenAlexW3133838614MaRDI QIDQ831176FDOQ831176
Authors: Dingding Jia, Benoît Libert 
Publication date: 10 May 2021
Published in: Designs, Codes and Cryptography (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-03380672/file/pub-DCC21.pdf
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
public key encryptiontight securityall-but-many lossy trapdoor functionschosen-ciphertext secureselective-opening security
Cites Work
- Probabilistic encryption
- On lattices, learning with errors, random linear codes, and cryptography
- Short signatures without random oracles and the SDH assumption in bilinear groups
- Efficient lattice (H)IBE in the standard model
- Efficient Identity-Based Encryption Without Random Oracles
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Title not available (Why is that?)
- Classical hardness of learning with errors
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- About the Security of MTI/C0 and MQV
- All-but-many lossy trapdoor functions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Title not available (Why is that?)
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Lossy trapdoor functions and their applications
- Advances in Cryptology - EUROCRYPT 2004
- Magic functions
- Theory of Cryptography
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Programmable Hash Functions and Their Applications
- An algebraic framework for Diffie-Hellman assumptions
- Identity-based encryption tightly secure under chosen-ciphertext attacks
- Standard security does not imply security against selective-opening
- On definitions of selective opening security
- Identity-based encryption secure against selective opening attack
- Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
- Encryption schemes secure against chosen-ciphertext selective opening attacks
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Tightly SIM-SO-CCA secure public key encryption from standard assumptions
- Selective Opening Security for Receivers
- (Hierarchical) identity-based encryption from affine message authentication
- Simulation-based selective opening CCA security for PKE from key encapsulation mechanisms
- On the selective opening security of practical public-key encryption schemes
- Selective opening security from simulatable data encapsulation
- Selective-Opening Security in the Presence of Randomness Failures
- Constructions secure against receiver selective opening and chosen ciphertext attacks
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- Identity-Based Encryption Secure against Selective Opening Chosen-Ciphertext Attack
- All-but-many lossy trapdoor functions from lattices and applications
- Lossy algebraic filters with short tags
- Simulation-based selective opening security for receivers under chosen-ciphertext attacks
- All-but-many encryption. A new framework for fully-equipped UC commitments
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Shrinking the keys of discrete-log-type lossy trapdoor functions
- Circular chosen-ciphertext security with compact ciphertexts
- Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions
Cited In (6)
- All-but-many lossy trapdoor functions from lattices and applications
- Simulation-based bi-selective opening security for public key encryption
- CCA-security from adaptive all-but-one lossy trapdoor functions
- All-but-many lossy trapdoor functions
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- Receiver selective opening security for identity-based encryption in the multi-challenge setting
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)
