Sciweavers

1059 search results - page 170 / 212
» Modeling Security Protocols as Games
Sort
View
JCS
2010
121views more  JCS 2010»
13 years 8 months ago
Computational soundness of symbolic zero-knowledge proofs
raction of cryptographic operations by term algebras, called Dolev-Yao models, is essential in almost all tool-supported methods for proving security protocols. Recently significa...
Michael Backes, Dominique Unruh
IJIT
2004
13 years 11 months ago
Practical Fair Anonymous Undeniable Signatures
We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also trac...
Song Han, Elizabeth Chang, Xiaotie Deng, Winson K....
IACR
2011
94views more  IACR 2011»
12 years 9 months ago
After-the-Fact Leakage in Public-Key Encryption
What does it mean for an encryption scheme to be leakage-resilient? Prior formulations require that the scheme remains semantically secure even in the presence of leakage, but onl...
Shai Halevi, Huijia Lin
MMMACNS
2001
Springer
14 years 2 months ago
Typed MSR: Syntax and Examples
Abstract. Many design flaws and incorrect analyses of cryptographic protoAppeared in the Proceedings of the First International Workshop on Mathematical Methods, Models and Archit...
Iliano Cervesato
EMSOFT
2005
Springer
14 years 3 months ago
Deeply embedded XML communication: towards an interoperable and seamless world
Current consumer electronics devices do not interoperate and are hard to use. Devices use proprietary, device-specific and inflexible protocols. Resources across device classes, s...
Johannes Helander