Cryptographic primitives with hinting property

DOI10.1007/S00145-024-09502-9MaRDI QIDQ6536746zbMATH OpenFDO

Authors Navid Alamati, Sikhar Patranabis

Publication date 13 May 2024

Published in Journal of Cryptology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/S00145-024-09502-9

zbMATH Keywords

hinting pseudorandom generator

Mathematics Subject Classification ID

Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Recommendations

• Cryptographic primitives with hinting property
• New constructions of hinting PRGs, OWFs with encryption, and more
• Reproducible circularly-secure bit encryption: applications and realizations
• On generic constructions of circularly-secure, leakage-resilient public-key encryption schemes
• Reproducible circularly secure bit encryption: applications and realizations

Cites work

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

Cited in

(1)

• Incompressible encryption beyond CPA/CCA security

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)