Sciweavers

152 search results - page 13 / 31
» Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sort
View
COMPSAC
2006
IEEE
15 years 6 months ago
Agent-Based Offline Electronic Voting
—Many electronic voting systems, classified mainly as homomorphic cryptography based, mix-net based and blind signature based, appear after the eighties when zero knowledge proof...
Mehmet Tahir Sandikkaya, Bülent Örencik
110
Voted
CRYPTO
1995
Springer
135views Cryptology» more  CRYPTO 1995»
15 years 4 months ago
Committed Oblivious Transfer and Private Multi-Party Computation
Abstract. In this paper we present an eficient protocol for “Committed Oblivious Transfer” to perform oblivious transfer on committed bits: suppose Alice is committed to bits 0...
Claude Crépeau, Jeroen van de Graaf, Alain ...
94
Voted
MMSEC
2006
ACM
102views Multimedia» more  MMSEC 2006»
15 years 6 months ago
Zero-knowledge watermark detector robust to sensitivity attacks
Current zero-knowledge watermark detectors are based on a linear correlation between the asset features and a given secret sequence. This detection function is susceptible of bein...
Juan Ramón Troncoso-Pastoriza, Fernando P&e...
TCOS
2010
14 years 7 months ago
J-PAKE: Authenticated Key Exchange without PKI
Password Authenticated Key Exchange (PAKE) is one of the important topics in cryptography. It aims to address a practical security problem: how to establish secure communication be...
Feng Hao, Peter Ryan
CRYPTO
1994
Springer
98views Cryptology» more  CRYPTO 1994»
15 years 4 months ago
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
Suppose we are given a proof of knowledge P in which a prover demonstrates that he knows a solution to a given problem instance. Suppose also that we have a secret sharing scheme S...
Ronald Cramer, Ivan Damgård, Berry Schoenmak...