scientific article; zbMATH DE number 1842510

zbMath1003.94528MaRDI QIDQ4783744

Leonid Reyzin, Silvio Micali

Publication date: 8 December 2002

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2139/21390542

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

interactive proofspublic-key model

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (17)

Concurrent knowledge extraction in public-key models ⋮ On QA-NIZK in the BPK Model ⋮ Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model ⋮ Classical and quantum security of elliptic curve VRF, via relative indifferentiability ⋮ Smooth zero-knowledge hash functions ⋮ The price of verifiability: lower bounds for verifiable random functions ⋮ Individual simulations ⋮ Constant-Round Concurrent Non-malleable Zero Knowledge in the Bare Public-Key Model ⋮ (2+\(f\)(\(n\)))-SAT and its properties. ⋮ On the impossibility of structure-preserving deterministic primitives ⋮ Election control through social influence with unknown preferences ⋮ Verifiable Random Functions from Standard Assumptions ⋮ On subversion-resistant SNARKs ⋮ Verifiable random functions: relations to identity-based key encapsulation and new constructions ⋮ Verifiable Random Functions from Identity-Based Key Encapsulation ⋮ Concurrently Non-malleable Black-Box Zero Knowledge in the Bare Public-Key Model ⋮ Impossibility on tamper-resilient cryptography with uniqueness properties

This page was built for publication: