Cryptographic primitives with hinting property

Cites Work

A Pseudorandom Generator from any One-way Function
On lattices, learning with errors, random linear codes, and cryptography
Circular-Secure Encryption from Decision Diffie-Hellman
Title not available (Why is that?)
On the Cryptographic Applications of Random Functions (Extended Abstract)
Lossy trapdoor functions and their applications
More Constructions of Lossy and Correlation-Secure Trapdoor Functions
An Algebraic Framework for Diffie-Hellman Assumptions
Towards a Separation of Semantic and CCA Security for Public Key Encryption
Black-Box Circular-Secure Encryption beyond Affine Functions
Key-dependent message security: generic amplification and completeness
Laconic oblivious transfer and its applications
CSIDH: an efficient post-quantum commutative group action
CSI-FiSh: efficient isogeny based signatures through class group computations
Key Homomorphic PRFs and Their Applications
Minicrypt primitives with algebraic structure and applications
Black-box non-interactive non-malleable commitments
Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
Cryptographic group actions and applications
CCA security and trapdoor functions via key-dependent-message security
On the CCA compatibility of public-key infrastructure
CPA-to-CCA transformation for KDM security
New constructions of hinting PRGs, OWFs with encryption, and more
Chosen ciphertext security from injective trapdoor functions
Symmetric primitives with structured secrets
Simple and efficient KDM-CCA secure public key encryption
Circular security is complete for KDM security
How to build a trapdoor function from an encryption scheme

This page was built for publication: Cryptographic primitives with hinting property

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6536746)