New constructions of hinting PRGs, OWFs with encryption, and more
type: Item
instance of: scholarly article
title: New constructions of hinting PRGs, OWFs with encryption, and more
zbMATH Open document ID: 1503.94029
DOI: 10.1007/978-3-030-56784-2_18
author: Rishab Goyal
author: Satyanarayana Vusirikala
author: Brent Waters
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614550
zbMATH Keywords: performance measurements
zbMATH Keywords: one-way function with encryption
describes a project that uses: FLINT
MaRDI profile type: Publication
full work available at URL: 978-3-030-56784-2 18
OpenAlex ID: W2978451984
cites work: Symmetric primitives with structured secrets
cites work: Minicrypt primitives with algebraic structure and applications
cites work: Dynamic Universal Accumulators for DDH Groups and Their Application to Attribute-Based Anonymous Credential Systems
cites work: Pairing-Friendly Elliptic Curves of Prime Order
cites work: Q4934724
cites work: Advances in Cryptology - EUROCRYPT 2004
cites work: Shrinking the Keys of Discrete-Log-Type Lossy Trapdoor Functions
cites work: An Accumulator Based on Bilinear Maps and Efficient Revocation for Anonymous Credentials
cites work: Q4409110
cites work: Vector Commitments and Their Applications
cites work: Laconic oblivious transfer and its applications
cites work: Identity-based encryption from the Diffie-Hellman assumption
cites work: New constructions of identity-based and key-dependent message secure encryption schemes
cites work: Trapdoor hash functions and their applications
cites work: From selective IBE to full IBE and selective HIBE
cites work: TNFS resistant families of pairing-friendly elliptic curves
cites work: New techniques for efficient trapdoor functions and applications
cites work: Trapdoor functions from the computational Diffie-Hellman assumption
cites work: Registration-based encryption: removing private-key generator from IBE
cites work: Registration-based encryption from standard assumptions
cites work: Efficient range-trapdoor functions and applications: rate-1 OT and more
cites work: Adaptive garbled RAM from laconic oblivious transfer
cites work: Adaptively secure garbling with near optimal online complexity
cites work: Information Security
cites work: Fast Library for Number Theory: An Introduction
cites work: Designated verifier/prover and preprocessing NIZKs from Diffie-Hellman assumptions
cites work: Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
cites work: CCA security and trapdoor functions via key-dependent-message security
cites work: Realizing chosen ciphertext security generically in attribute-based encryption and predicate encryption
cites work: New constructions of reusable designated-verifier NIZKs
cites work: Challenges with assessing the impact of NFS advances on the security of pairing-based cryptography
cites work: Topics in Cryptology – CT-RSA 2005
cites work: Reusable designated-verifier NIZKs for all NP from CDH
cites work: Q4536287
cites work: The Magic of ELFs
description: scientific article; zbMATH DE number 7614550