Sciweavers

195 search results - page 4 / 39
» Security and Privacy Using One-Round Zero-Knowledge Proofs
Sort
View
108
Voted
CRYPTO
2010
Springer
158views Cryptology» more  CRYPTO 2010»
15 years 2 months ago
Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography
Motivated by the question of basing cryptographic protocols on stateless tamper-proof hardware tokens, we revisit the question of unconditional two-prover zero-knowledge proofs fo...
Vipul Goyal, Yuval Ishai, Mohammad Mahmoody, Amit ...
125
Voted
IPPS
2007
IEEE
15 years 7 months ago
Pseudo Trust: Zero-Knowledge Based Authentication in Anonymous Peer-to-Peer Protocols
Most of the current trust models in peer-to-peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer’s ide...
Li Lu, Jinsong Han, Lei Hu, Jinpeng Huai, Yunhao L...
121
Voted
TPDS
2008
116views more  TPDS 2008»
15 years 1 months ago
Pseudo Trust: Zero-Knowledge Authentication in Anonymous P2Ps
Most trust models in Peer-to-Peer (P2P) systems are identity based, which means that in order for one peer to trust another, it needs to know the other peer's identity. Hence,...
Li Lu, Jinsong Han, Yunhao Liu, Lei Hu, Jinpeng Hu...
112
Voted
FC
2000
Springer
127views Cryptology» more  FC 2000»
15 years 4 months ago
Blind, Auditable Membership Proofs
Auditability is an important property in nancial systems and architectures. Here we de ne the primitive of blind auditable membership proof" BAMP which combines public auditab...
Tomas Sander, Amnon Ta-Shma, Moti Yung
103
Voted
ESORICS
2009
Springer
15 years 8 months ago
Using SAT-Solvers to Compute Inference-Proof Database Instances
Cornelia Tadros, Lena Wiese