195 search results - page 6 / 39 » Security and Privacy Using One-Round Zero-Knowledge Proofs |
90
Voted
PROVSEC
2007
Springer
15 years 3 months ago
2007
Springer
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
63
Voted
EUROCRYPT
2009
Springer
15 years 10 months ago
2009
Springer
The notion of Zero Knowledge Proofs (of knowledge) [ZKP] is central to cryptography; it provides a set of security properties that proved indispensable in concrete protocol design...
ACISP
2004
Springer
15 years 2 months ago
2004
Springer
The Canetti-Krawczyk (CK) model is useful for building reusable components that lead to rapid development of secure protocols, especially for engineers working outside of the secur...
77
Voted
SP
2009
IEEE
15 years 4 months ago
2009
IEEE
We present two machine-checked proofs of the existential unforgeability under adaptive chosen-message attacks of the Full Domain Hash signature scheme. These proofs formalize the ...
78
Voted
MMSEC
2006
ACM
15 years 3 months ago
2006
ACM
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...