Sciweavers

22 search results - page 3 / 5
» Zero Knowledge and Soundness Are Symmetric
Sort
View
ASIACRYPT
2004
Springer
13 years 11 months ago
Improved Setup Assumptions for 3-Round Resettable Zero Knowledge
In the bare public-key model, introduced by Canetti et al. [STOC 2000], it is only assumed that each verifier deposits during a setup phase a public key in a file accessible by a...
Giovanni Di Crescenzo, Giuseppe Persiano, Ivan Vis...
ECCC
2000
120views more  ECCC 2000»
13 years 5 months ago
A Complete Problem for Statistical Zero Knowledge
Abstract. We present the first complete problem for SZK, the class of promise problems possessing statistical zero-knowledge proofs (against an honest verifier). The problem, calle...
Amit Sahai, Salil P. Vadhan
FOCS
2006
IEEE
13 years 11 months ago
Succinct Non-Interactive Zero-Knowledge Proofs with Preprocessing for LOGSNP
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
Yael Tauman Kalai, Ran Raz
IH
2001
Springer
13 years 10 months ago
Zero-Knowledge Watermark Detection and Proof of Ownership
The goal of zero-knowledge watermark detection is to allow a prover to soundly convince a verifier of the presence of a watermark in certain stego-data without revealing any infor...
André Adelsbach, Ahmad-Reza Sadeghi
SP
2008
IEEE
132views Security Privacy» more  SP 2008»
13 years 4 months ago
Zero-Knowledge in the Applied Pi-calculus and Automated Verification of the Direct Anonymous Attestation Protocol
e an abstraction of zero-knowledge protocols that is le to a fully mechanized analysis. The abstraction is formalized within the applied pi-calculus using a novel equational theor...
Michael Backes, Matteo Maffei, Dominique Unruh