Sciweavers

139 search results - page 10 / 28
» Zero-Knowledge
Sort
View
FOCS
2006
IEEE
14 years 4 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
FOCS
2006
IEEE
14 years 4 months ago
Concurrent Non-Malleable Zero Knowledge
Boaz Barak, Manoj Prabhakaran, Amit Sahai
WECWIS
2005
IEEE
116views ECommerce» more  WECWIS 2005»
14 years 4 months ago
Security and Privacy Using One-Round Zero-Knowledge Proofs
A zero-knowledge proof (ZKP) is an interactive proof that allows a prover to prove the knowledge of a secret to a verifier without revealing it. ZKPs are powerful tools to deal wi...
Sultan Almuhammadi, Clifford Neuman
ACNS
2005
Springer
84views Cryptology» more  ACNS 2005»
14 years 4 months ago
Non-interactive Zero-Knowledge Arguments for Voting
Abstract. In voting based on homomorphic threshold encryption, the voter encrypts his vote and sends it in to the authorities that tally the votes. If voters can send in arbitrary ...
Jens Groth
ASIACRYPT
2005
Springer
14 years 4 months ago
Updatable Zero-Knowledge Databases
Moses Liskov