New constructions of hinting PRGs, OWFs with encryption, and more
From MaRDI portal
Publication:2096498
DOI10.1007/978-3-030-56784-2_18zbMath1503.94029OpenAlexW2978451984MaRDI QIDQ2096498
Rishab Goyal, Brent Waters, Satyanarayana Vusirikala
Publication date: 9 November 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-56784-2_18
Related Items (6)
Batch-OT with optimal rate ⋮ Cryptographic primitives with hinting property ⋮ On non-uniform security for black-box non-interactive CCA commitments ⋮ One-time programs from commodity hardware ⋮ Laconic private set intersection and applications ⋮ Amortizing rate-1 OT and applications to PIR and PSI
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Adaptive garbled RAM from laconic oblivious transfer
- Registration-based encryption: removing private-key generator from IBE
- Adaptively secure garbling with near optimal online complexity
- Identity-based encryption from the Diffie-Hellman assumption
- Laconic oblivious transfer and its applications
- From selective IBE to full IBE and selective HIBE
- New constructions of identity-based and key-dependent message secure encryption schemes
- Trapdoor functions from the computational Diffie-Hellman assumption
- Efficient range-trapdoor functions and applications: rate-1 OT and more
- Symmetric primitives with structured secrets
- Registration-based encryption from standard assumptions
- New techniques for efficient trapdoor functions and applications
- Reusable designated-verifier NIZKs for all NP from CDH
- Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
- Trapdoor hash functions and their applications
- New constructions of reusable designated-verifier NIZKs
- Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
- TNFS resistant families of pairing-friendly elliptic curves
- Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
- The Magic of ELFs
- Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
- Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
- An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
- Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
- Vector Commitments and Their Applications
- Advances in Cryptology - EUROCRYPT 2004
- Pairing-Friendly Elliptic Curves of Prime Order
- Information Security
- Topics in Cryptology – CT-RSA 2005
- Fast Library for Number Theory: An Introduction
- Minicrypt primitives with algebraic structure and applications
- CCA security and trapdoor functions via key-dependent-message security
This page was built for publication: New constructions of hinting PRGs, OWFs with encryption, and more
