Sciweavers

1446 search results - page 18 / 290
» Local zero knowledge
Sort
View
ASIACRYPT
2001
Springer
15 years 1 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
COCO
1991
Springer
130views Algorithms» more  COCO 1991»
15 years 1 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»
14 years 11 months ago
Efficient Constructions of Composable Commitments and Zero-Knowledge Proofs
Yevgeniy Dodis, Victor Shoup, Shabsi Walfish
ICALP
2007
Springer
14 years 11 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
EUROCRYPT
2008
Springer
14 years 11 months ago
Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle
A shuffle of a set of ciphertexts is a new set of ciphertexts with the same plaintexts in permuted order. Shuffles of homomorphic encryptions are a key component in mix-nets, whic...
Jens Groth, Yuval Ishai