Lossy trapdoor functions and their applications
From MaRDI portal
Publication:3549700
DOI10.1145/1374376.1374406zbMath1228.94027OpenAlexW2152783950MaRDI QIDQ3549700
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
Related Items (only showing first 100 items - show all)
A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Non-malleable functions and their applications ⋮ Lattice-based key exchange on small integer solution problem ⋮ Witness Maps and Applications ⋮ Toward RSA-OAEP Without Random Oracles ⋮ Improved computational extractors and their applications ⋮ SO-CCA secure PKE from pairing based all-but-many lossy trapdoor functions ⋮ Upgrading to functional encryption ⋮ Adaptively secure distributed PRFs from LWE ⋮ An efficient CCA-secure cryptosystem over ideal lattices from identity-based encryption ⋮ Targeted lossy functions and applications ⋮ Compact Lossy and All-but-One Trapdoor Functions from Lattice ⋮ The ECCA Security of Hybrid Encryptions ⋮ Simpler CCA-Secure Public Key Encryption from Lossy Trapdoor Functions ⋮ Approximate-Deterministic Public Key Encryption from Hard Learning Problems ⋮ Receiver Selective Opening Security from Indistinguishability Obfuscation ⋮ Standard Security Does Not Imply Indistinguishability Under Selective Opening ⋮ Public-Key Encryption with Simulation-Based Selective-Opening Security and Compact Ciphertexts ⋮ Regular lossy functions and their applications in leakage-resilient cryptography ⋮ Black-box accumulation based on lattices ⋮ A counterexample to the chain rule for conditional HILL entropy ⋮ Everlasting UC commitments from fully malicious PUFs ⋮ Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model ⋮ Efficient cryptosystems from \(2^k\)-th power residue symbols ⋮ Toward non-interactive zero-knowledge proofs for NP from LWE ⋮ A pseudorandom number generator based on worst-case lattice problems ⋮ Improved, black-box, non-malleable encryption from semantic security ⋮ Augmented Learning with Errors: The Untapped Potential of the Error Term ⋮ Hardness of \(k\)-LWE and applications in traitor tracing ⋮ Collapse-Binding Quantum Commitments Without Random Oracles ⋮ Selective Opening Security from Simulatable Data Encapsulation ⋮ Selective-Opening Security in the Presence of Randomness Failures ⋮ Déjà Q All Over Again: Tighter and Broader Reductions of q-Type Assumptions ⋮ Computational Security of Quantum Encryption ⋮ Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage ⋮ Public-Key Cryptosystems Resilient to Continuous Tampering and Leakage of Arbitrary Functions ⋮ Group homomorphic encryption: characterizations, impossibility results, and applications ⋮ More constructions of lossy and correlation-secure trapdoor functions ⋮ Practical chosen ciphertext secure encryption from factoring ⋮ Secure integration of asymmetric and symmetric encryption schemes ⋮ Programmable hash functions and their applications ⋮ Disappearing cryptography in the bounded storage model ⋮ Towards tight adaptive security of non-interactive key exchange ⋮ Leakage-resilient cryptography from puncturable primitives and obfuscation ⋮ Lossy trapdoor functions from homomorphic reproducible encryption ⋮ Lattice-based completely non-malleable public-key encryption in the standard model ⋮ BI-NTRU Encryption Schemes: Two New Secure Variants of NTRU ⋮ Towards Tightly Secure Deterministic Public Key Encryption ⋮ Extremal set theory and LWE based access structure hiding verifiable secret sharing with malicious-majority and free verification ⋮ Strongly secure authenticated key exchange from factoring, codes, and lattices ⋮ A black-box construction of non-malleable encryption from semantically secure encryption ⋮ All-but-many encryption ⋮ Optimal security proofs for full domain hash. Revisited ⋮ Improved (Hierarchical) Inner-Product Encryption from Lattices ⋮ Key Encapsulation Mechanisms from Extractable Hash Proof Systems, Revisited ⋮ Sender-Equivocable Encryption Schemes Secure against Chosen-Ciphertext Attacks Revisited ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ A generic construction of CCA-secure deterministic encryption ⋮ Efficient Broadcast Encryption with Personalized Messages ⋮ Toward an Easy-to-Understand Structure for Achieving Chosen Ciphertext Security from the Decisional Diffie-Hellman Assumption ⋮ Cryptographic Functions from Worst-Case Complexity Assumptions ⋮ On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles ⋮ Deterministic Encryption: Definitional Equivalences and Constructions without Random Oracles ⋮ Perfect Structure on the Edge of Chaos ⋮ Simulation-based receiver selective opening CCA secure PKE from standard computational assumptions ⋮ Point-Function Obfuscation: A Framework and Generic Constructions ⋮ A lattice-based signcryption scheme without random oracles ⋮ A unified approach to deterministic encryption: new constructions and a connection to computational entropy ⋮ Predicting Lattice Reduction ⋮ Fine-grained cryptography revisited ⋮ Better Key Sizes (and Attacks) for LWE-Based Encryption ⋮ Related-key secure key encapsulation from extended computational bilinear Diffie-Hellman ⋮ Adaptively secure distributed PRFs from \(\mathsf{LWE}\) ⋮ CCA security and trapdoor functions via key-dependent-message security ⋮ An Efficient Encapsulation Scheme from Near Collision Resistant Pseudorandom Generators and Its Application to IBE-to-PKE Transformations ⋮ A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model ⋮ Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening ⋮ Practical Chosen Ciphertext Secure Encryption from Factoring ⋮ Efficient Completely Non-Malleable and RKA Secure Public Key Encryptions ⋮ Minicrypt primitives with algebraic structure and applications ⋮ Extracting randomness from extractor-dependent sources ⋮ Low error efficient computational extractors in the CRS model ⋮ Quantum-access-secure message authentication via blind-unforgeability ⋮ Classical vs quantum random oracles ⋮ The Geometry of Lattice Cryptography ⋮ Deterministic Public-Key Encryption Under Continual Leakage ⋮ General Construction of Chameleon All-But-One Trapdoor Functions ⋮ On selective-opening security of deterministic primitives ⋮ Adversary-Dependent Lossy Trapdoor Function from Hardness of Factoring Semi-smooth RSA Subgroup Moduli ⋮ LWE from non-commutative group rings ⋮ Efficient Threshold Encryption from Lossy Trapdoor Functions ⋮ The magic of ELFs ⋮ Backdoors in Pseudorandom Number Generators: Possibility and Impossibility Results ⋮ The Magic of ELFs ⋮ A Twist on the Naor-Yung Paradigm and Its Application to Efficient CCA-Secure Encryption from Hard Search Problems ⋮ Public-Key Cryptographic Primitives Provably as Secure as Subset Sum ⋮ Leakage-resilient key exchange and two-seed extractors ⋮ Incompressible encodings ⋮ Chosen ciphertext security from injective trapdoor functions ⋮ Revocable hierarchical identity-based authenticated key exchange
This page was built for publication: Lossy trapdoor functions and their applications
