Lossy trapdoor functions and their applications
From MaRDI portal
Publication:3549700
DOI10.1145/1374376.1374406zbMATH Open1228.94027OpenAlexW2152783950MaRDI QIDQ3549700FDOQ3549700
Authors: Chris Peikert, Brent Waters 
Publication date: 5 January 2009
Published in: Proceedings of the fortieth annual ACM symposium on Theory of computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1145/1374376.1374406
Recommendations
Cited In (only showing first 100 items - show all)
- Adaptively secure distributed PRFs from \(\mathsf{LWE}\)
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Practical Chosen Ciphertext Secure Encryption from Factoring
- Augmented Learning with Errors: The Untapped Potential of the Error Term
- A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems
- Lossy Trapdoor Functions and Their Applications
- Backdoors in pseudorandom number generators: possibility and impossibility results
- Trapdoor functions from the computational Diffie-Hellman assumption
- SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions
- Fine-grained cryptography revisited
- Succinct classical verification of quantum computation
- Group homomorphic encryption: characterizations, impossibility results, and applications
- Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles
- Computational Security of Quantum Encryption
- Lattice-based key exchange on small integer solution problem
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- Point-function obfuscation: a framework and generic constructions
- The geometry of lattice cryptography
- Selective-Opening Security in the Presence of Randomness Failures
- An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption
- All-but-many encryption
- Optimal security proofs for full domain hash. Revisited
- Quantum-access-secure message authentication via blind-unforgeability
- A generic construction of CCA-secure deterministic encryption
- Predicting Lattice Reduction
- Shrinking the keys of discrete-log-type lossy trapdoor functions
- Upgrading to functional encryption
- Adaptively secure distributed PRFs from LWE
- Collapse-binding quantum commitments without random oracles
- Deterministic Public-Key Encryption Under Continual Leakage
- Programmable hash functions and their applications
- Perfect structure on the edge of chaos. Trapdoor permutations from indistinguishability obfuscation
- The ECCA Security of Hybrid Encryptions
- Regular lossy functions and their applications in leakage-resilient cryptography
- Improved, black-box, non-malleable encryption from semantic security
- Lattice-based completely non-malleable public-key encryption in the standard model
- Extended-DDH and lossy trapdoor functions
- On the lossiness of the Rabin trapdoor function
- Improved computational extractors and their applications
- More constructions of lossy and correlation-secure trapdoor functions
- Lossy trapdoor functions from homomorphic reproducible encryption
- Zero-knowledge arguments for subverted RSA groups
- Leakage-resilient key exchange and two-seed extractors
- Better key sizes (and attacks) for LWE-based encryption
- A counterexample to the chain rule for conditional HILL entropy
- Towards tightly secure deterministic public key encryption
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Cryptographic functions from worst-case complexity assumptions
- The Magic of ELFs
- Efficient completely non-malleable and RKA secure public key encryptions
- A pseudorandom number generator based on worst-case lattice problems
- Secure integration of asymmetric and symmetric encryption schemes
- Sender-equivocable encryption schemes secure against chosen-ciphertext attacks revisited
- A lattice-based signcryption scheme without random oracles
- Building lossy trapdoor functions from lossy encryption
- Practical chosen ciphertext secure encryption from factoring
- Leakage-resilient cryptography from puncturable primitives and obfuscation
- Strongly secure authenticated key exchange from factoring, codes, and lattices
- Hardness of \(k\)-LWE and applications in traitor tracing
- Chosen-ciphertext security from slightly lossy trapdoor functions
- More constructions of lossy and correlation-secure trapdoor functions
- Black-box accumulation based on lattices
- A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
- Approximate-deterministic public key encryption from hard learning problems
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Identity-based (lossy) trapdoor functions and applications
- Identity-based lossy trapdoor functions: new definitions, hierarchical extensions, and implications
- Selective opening security from simulatable data encapsulation
- Standard security does not imply indistinguishability under selective opening
- Public-key encryption with simulation-based selective-opening security and compact ciphertexts
- Regularly lossy functions and applications
- Public-Key Cryptographic Primitives Provably as Secure as Subset Sum
- On the exact round complexity of self-composable two-party computation
- A black-box construction of non-malleable encryption from semantically secure encryption
- On security notions for encryption in a quantum world
- Lossy trapdoor permutations with improved lossiness
- An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations
- Cryptographic primitives with hinting property
- Revocable hierarchical identity-based authenticated key exchange
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- A black-box approach to post-quantum zero-knowledge in constant rounds
- Toward non-interactive zero-knowledge proofs for NP from LWE
- Searching for ELFs in the cryptographic forest
- New construction of lossy function families
- The magic of ELFs
- Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification
- Minicrypt primitives with algebraic structure and applications
- Improved (hierarchical) inner-product encryption from lattices
- Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage
- Targeted lossy functions and applications
- Lossy Trapdoor Relation and Its Applications to Lossy Encryption and Adaptive Trapdoor Relation
- How to build a trapdoor function from an encryption scheme
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- A framework for statistically sender private OT with optimal rate
- Non-interactive zero-knowledge from non-interactive batch arguments
- Efficient broadcast encryption with personalized messages
- Injective rank metric trapdoor functions with homogeneous errors
- Everlasting UC commitments from fully malicious PUFs
This page was built for publication: Lossy trapdoor functions and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549700)
