New constructions of hinting PRGs, OWFs with encryption, and more
From MaRDI portal
Publication:2096498
Recommendations
- Cryptographic primitives with hinting property
- Semi-adaptively secure offline witness encryption from puncturable witness PRF
- Minicrypt primitives with algebraic structure and applications
- Offline witness encryption from witness PRF and randomized encoding in CRS model
- Minicrypt primitives with algebraic structure and applications
Cites work
- Adaptive garbled RAM from laconic oblivious transfer
- Adaptively secure garbling with near optimal online complexity
- Advances in Cryptology - EUROCRYPT 2004
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- CCA security and trapdoor functions via key-dependent-message security
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Extended tower number field sieve: a new complexity for the medium prime case
- Fast Library for Number Theory: An Introduction
- From selective IBE to full IBE and selective HIBE
- scientific article; zbMATH DE number 1942413 (Why is no real title available?)
- scientific article; zbMATH DE number 1759347 (Why is no real title available?)
- scientific article; zbMATH DE number 1394309 (Why is no real title available?)
- Identity-based encryption from the Diffie-Hellman assumption
- Information Security
- Laconic oblivious transfer and its applications
- Minicrypt primitives with algebraic structure and applications
- New constructions of identity-based and key-dependent message secure encryption schemes
- New constructions of reusable designated-verifier NIZKs
- New techniques for efficient trapdoor functions and applications
- Pairing-Friendly Elliptic Curves of Prime Order
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- Registration-based encryption from standard assumptions
- Registration-based encryption: removing private-key generator from IBE
- Reusable designated-verifier NIZKs for all NP from CDH
- Shrinking the keys of discrete-log-type lossy trapdoor functions
- Symmetric primitives with structured secrets
- The Magic of ELFs
- TNFS resistant families of pairing-friendly elliptic curves
- Topics in Cryptology – CT-RSA 2005
- Trapdoor functions from the computational Diffie-Hellman assumption
- Trapdoor hash functions and their applications
- Vector commitments and their applications
Cited in
(11)- Batch-OT with optimal rate
- A fast and simple partially oblivious PRF, with applications
- Doubly half-injective PRGs for incompressible white-box cryptography
- Laconic private set intersection and applications
- Amortizing rate-1 OT and applications to PIR and PSI
- Constraint-Hiding Constrained PRFs for NC $$^1$$ from LWE
- Cryptographic primitives with hinting property
- On non-uniform security for black-box non-interactive CCA commitments
- One-time programs from commodity hardware
- Anonymous (hierarchical) identity-based encryption from broader assumptions
- Cryptographic primitives with hinting property
This page was built for publication: New constructions of hinting PRGs, OWFs with encryption, and more
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2096498)
