Cumulatively all-lossy-but-one trapdoor functions from standard assumptions

DOI10.1007/978-3-031-14791-3_15zbMath1518.94077MaRDI QIDQ6134825

Ky T. Nguyen, Benoît Libert, Alain Passelègue

Publication date: 25 July 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

lossy trapdoor functionsstandard assumptionscumulative lossiness

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Cites Work

• Unnamed Item
• Unnamed Item
• Adaptively secure distributed PRFs from LWE
• All-but-many lossy trapdoor functions from lattices and applications
• All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
• Extracting randomness from extractor-dependent sources
• Low error efficient computational extractors in the CRS model
• Targeted lossy functions and applications
• Lossy algebraic filters with short tags
• Lossy trapdoor permutations with improved lossiness
• New techniques for efficient trapdoor functions and applications
• Trapdoor hash functions and their applications
• Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
• Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
• Learning with Rounding, Revisited
• Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
• Key Homomorphic PRFs and Their Applications
• Constrained Pseudorandom Functions and Their Applications
• New and Improved Key-Homomorphic Pseudorandom Functions
• All-But-Many Lossy Trapdoor Functions
• Identity-Based (Lossy) Trapdoor Functions and Applications
• Dual Projective Hashing and Its Applications — Lossy Trapdoor Functions and More
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• Pseudorandom Functions and Lattices
• Extended-DDH and Lossy Trapdoor Functions
• Leveled Fully Homomorphic Signatures from Standard Lattices
• Lattice-based FHE as secure as PKE
• Lossy Encryption: Constructions from General Assumptions and Efficient Selective Opening Chosen Ciphertext Security
• Predicate Encryption for Circuits from LWE
• Lossy trapdoor functions and their applications
• Trapdoors for hard lattices and new cryptographic constructions
• More Constructions of Lossy and Correlation-Secure Trapdoor Functions
• Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions
• Efficient Lattice (H)IBE in the Standard Model
• Instantiability of RSA-OAEP under Chosen-Plaintext Attack
• 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
• Hedged Public-Key Encryption: How to Protect against Bad Randomness
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• A Pseudorandom Generator from any One-way Function
• Deterministic Public-Key Encryption for Adaptively Chosen Plaintext Distributions
• Circular Chosen-Ciphertext Security with Compact Ciphertexts
• Witness Maps and Applications
• Advances in Cryptology – CRYPTO 2004
• Functional Signatures and Pseudorandom Functions
• Fully Key-Homomorphic Encryption, Arithmetic Circuit ABE and Compact Garbled Circuits
• Advances in Cryptology - CRYPTO 2003
• On lattices, learning with errors, random linear codes, and cryptography

This page was built for publication: Cumulatively all-lossy-but-one trapdoor functions from standard assumptions