Sciweavers

27 search results - page 4 / 6
» Sequential Rationality in Cryptographic Protocols
Sort
View
SEC
2008
13 years 8 months ago
Hiding in Groups: On the Expressiveness of Privacy Distributions
Many applications inherently disclose information because perfect privacy protection is prohibitively expensive. RFID tags, for example, cannot be equipped with the cryptographic p...
Karsten Nohl, David Evans
TARK
2007
Springer
14 years 1 months ago
Knowledge-based modelling of voting protocols
We contend that reasoning about knowledge is both natural and pragmatic for verification of electronic voting protocols. We present a model in which desirable properties of elect...
A. Baskar, Ramaswamy Ramanujam, S. P. Suresh
EUROCRYPT
2009
Springer
14 years 8 months ago
On the Portability of Generalized Schnorr Proofs
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...
Jan Camenisch, Aggelos Kiayias, Moti Yung
EUROCRYPT
2006
Springer
13 years 11 months ago
Composition Implies Adaptive Security in Minicrypt
To prove that a secure key-agreement protocol exists one must at least show P = NP. Moreover any proof that the sequential composition of two non-adaptively secure pseudorandom fun...
Krzysztof Pietrzak
PKC
1999
Springer
91views Cryptology» more  PKC 1999»
13 years 11 months ago
A Secure Pay-per View Scheme for Web-Based Video Service
With the development of high speed computer networks, video service on the Web has huge market potential in that the video service can be provided to subscribers with greater time ...
Jianying Zhou, Kwok-Yan Lam