Sciweavers

139 search results - page 17 / 28
» Zero-Knowledge
Sort
View
ASIACRYPT
2001
Springer
13 years 11 months ago
Efficient Zero-Knowledge Authentication Based on a Linear Algebra Problem MinRank
A Zero-knowledge protocol provides provably secure entity authentication based on a hard computational problem. Among many schemes proposed since 1984, the most practical rely on f...
Nicolas Courtois
EUROCRYPT
2000
Springer
13 years 11 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
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
13 years 11 months ago
One-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
Abstract Rafail Ostrovskyy MIT Laboratory for Computer Science 545 Technology Square, Cambridge, MA 02139 In this paper, we study connections among one-way functions, hard on the ...
Rafail Ostrovsky
CRYPTO
2008
Springer
85views Cryptology» more  CRYPTO 2008»
13 years 9 months ago
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Yevgeniy Dodis, Victor Shoup, Shabsi Walfish
ICALP
2007
Springer
13 years 9 months ago
Trading Static for Adaptive Security in Universally Composable Zero-Knowledge
Adaptive security, while more realistic as an adversarial model, is typically much harder to achieve compared to static security in cryptographic protocol design. Universal composi...
Aggelos Kiayias, Hong-Sheng Zhou