Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
From MaRDI portal
Publication:6134825
Recommendations
- All-but-many lossy trapdoor functions
- Compact Lossy and All-but-One Trapdoor Functions from Lattice
- All-but-many lossy trapdoor functions from lattices and applications
- Lossy trapdoor functions and their applications
- Lossy Trapdoor Functions and Their Applications
- All-but-many lossy trapdoor functions and selective opening chosen-ciphertext security from LWE
- CCA-security from adaptive all-but-one lossy trapdoor functions
- Lossy trapdoor functions from homomorphic reproducible encryption
- Building lossy trapdoor functions from lossy encryption
- On the lossiness of the Rabin trapdoor function
Cites work
- scientific article; zbMATH DE number 1618044 (Why is no real title available?)
- scientific article; zbMATH DE number 1942445 (Why is no real title available?)
- A Pseudorandom Generator from any One-way Function
- Adaptively secure distributed PRFs from LWE
- Advances in Cryptology - CRYPTO 2003
- Advances in Cryptology – CRYPTO 2004
- 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
- Candidate indistinguishability obfuscation and functional encryption for all circuits
- Chosen-ciphertext security from slightly lossy trapdoor functions
- Circuit-ABE from LWE: Unbounded Attributes and Semi-adaptive Security
- Circular chosen-ciphertext security with compact ciphertexts
- Constrained pseudorandom functions and their applications
- Deterministic public-key encryption for adaptively chosen plaintext distributions
- Dual projective hashing and its applications -- lossy trapdoor functions and more
- Efficient lattice (H)IBE in the standard model
- Extended-DDH and lossy trapdoor functions
- Extracting randomness from extractor-dependent sources
- Fully key-homomorphic encryption, arithmetic circuit ABE and compact garbled circuits
- Functional signatures and pseudorandom functions
- Hedged public-key encryption: how to protect against bad randomness
- Homomorphic encryption from learning with errors: conceptually-simpler, asymptotically-faster, attribute-based
- Identity-based (lossy) trapdoor functions and applications
- Instantiability of RSA-OAEP under chosen-plaintext attack
- Key homomorphic PRFs and their applications
- Lattice-based FHE as secure as PKE
- Learning with rounding, revisited. New reduction, properties and applications
- Leveled fully homomorphic signatures from standard lattices
- 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
- Lossy trapdoor permutations with improved lossiness
- Low error efficient computational extractors in the CRS model
- More constructions of lossy and correlation-secure trapdoor functions
- New and improved key-homomorphic pseudorandom functions
- New techniques for efficient trapdoor functions and applications
- On Notions of Security for Deterministic Encryption, and Efficient Constructions without Random Oracles
- On lattices, learning with errors, random linear codes, and cryptography
- Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening
- Predicate encryption for circuits from LWE
- Pseudorandom functions and lattices
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Targeted lossy functions and applications
- Trapdoor hash functions and their applications
- Trapdoors for hard lattices and new cryptographic constructions
- Trapdoors for lattices: simpler, tighter, faster, smaller
- Witness maps and applications
Cited in
(4)
This page was built for publication: Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134825)
