Sciweavers

1446 search results - page 8 / 290
» Local zero knowledge
Sort
View
ASIACRYPT
2011
Springer
12 years 10 months ago
Resettable Cryptography in Constant Rounds - The Case of Zero Knowledge
A fundamental question in cryptography deals with understanding the role that randomness plays in cryptographic protocols and to what extent it is necessary. One particular line o...
Yi Deng, Dengguo Feng, Vipul Goyal, Dongdai Lin, A...
CORR
2006
Springer
169views Education» more  CORR 2006»
13 years 11 months ago
Concurrently Non-Malleable Zero Knowledge in the Authenticated Public-Key Model
We consider a type of zero-knowledge protocols that are of interest for their practical applications within networks like the Internet: efficient zero-knowledge arguments of knowl...
Yi Deng, Giovanni Di Crescenzo, Dongdai Lin
USS
2010
13 years 8 months ago
ZKPDL: A Language-Based System for Efficient Zero-Knowledge Proofs and Electronic Cash
In recent years, many advances have been made in cryptography, as well as in the performance of communication networks and processors. As a result, many advanced cryptographic pro...
Sarah Meiklejohn, C. Christopher Erway, Alptekin K...
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
EUROCRYPT
2000
Springer
14 years 2 months ago
Efficient Concurrent Zero-Knowledge in the Auxiliary String Model
We show that if any one-way function exists, then 3-round concurrent zero-knowledge arguments for all NP problems can be built in a model where a short auxiliary string with a pres...
Ivan Damgård