Sciweavers

27 search results - page 6 / 6
» Efficient Non-interactive Proof Systems for Bilinear Groups
Sort
View
STOC
2004
ACM
157views Algorithms» more  STOC 2004»
15 years 9 months ago
Derandomizing homomorphism testing in general groups
The main result of this paper is a near-optimal derandomization of the affine homomorphism test of Blum, Luby and Rubinfeld (Journal of Computer and System Sciences, 1993). We sho...
Amir Shpilka, Avi Wigderson
173
Voted
EUROPKI
2009
Springer
14 years 7 months ago
Automatic Generation of Sigma-Protocols
Efficient zero-knowledge proofs of knowledge (ZK-PoK) are basic building blocks of many cryptographic applications such as identification schemes, group signatures, and secure mult...
Endre Bangerter, Thomas Briner, Wilko Henecka, Ste...