More constructions of lossy and correlation-secure trapdoor functions
From MaRDI portal
(Redirected from Publication:3562902)
More constructions of lossy and correlation-secure trapdoor functions (scientific article; zbMATH DE number 5713636)
More constructions of lossy and correlation-secure trapdoor functions (scientific article; zbMATH DE number 5713636)
Recommendations
Cited in
(36)- More constructions of lossy and correlation-secure trapdoor functions
- Wave: a new family of trapdoor one-way preimage sampleable functions based on codes
- Lossy trapdoor permutations with improved lossiness
- The magic of ELFs
- The Rabin cryptosystem revisited
- Fully leakage-resilient signatures
- Efficient cryptosystems from \(2^k\)-th power residue symbols
- A unified approach to deterministic encryption: new constructions and a connection to computational entropy
- Point-function obfuscation: a framework and generic constructions
- Deterministic Public-Key Encryption Under Continual Leakage
- Adversary-dependent lossy trapdoor function from hardness of factoring semi-smooth RSA subgroup moduli
- The Magic of ELFs
- Identity-based (lossy) trapdoor functions and applications
- Correlated product security from any one-way function
- Extended-DDH and lossy trapdoor functions
- Updatable Lossy Trapdoor Functions and Its Application in Continuous Leakage
- Lossy key encapsulation mechanism and its applications
- General construction of chameleon all-but-one trapdoor functions
- Efficient threshold encryption from lossy trapdoor functions
- Receiver Selective Opening Security from Indistinguishability Obfuscation
- Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
- Lossy trapdoor functions and their applications
- Shrinking the keys of discrete-log-type lossy trapdoor functions
- Lossy trapdoor functions from homomorphic reproducible encryption
- Compact Lossy and All-but-One Trapdoor Functions from Lattice
- New construction of lossy function families
- SNARGs and PPAD hardness from the decisional Diffie-Hellman assumption
- A new security notion for PKC in the standard model: weaker, simpler, and still realizing secure channels
- Candidate trapdoor claw-free functions from group actions with applications to quantum protocols
- Cumulatively all-lossy-but-one trapdoor functions from standard assumptions
- Cryptographic primitives with hinting property
- How to build a trapdoor function from an encryption scheme
- Cryptographic primitives with hinting property
- Compact selective opening security from LWE
- Lossy cryptography from code-based assumptions
- Better security for deterministic public-key encryption: the auxiliary-input setting
This page was built for publication: More constructions of lossy and correlation-secure trapdoor functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3562902)