Sciweavers

719 search results - page 106 / 144
» Proving Security Protocols Correct
Sort
View
78
Voted
CCS
2009
ACM
15 years 4 months ago
CoSP: a general framework for computational soundness proofs
We describe CoSP, a general framework for conducting computational soundness proofs of symbolic models and for embedding these proofs into formal calculi. CoSP considers arbitrary...
Michael Backes, Dennis Hofheinz, Dominique Unruh
CISC
2007
Springer
156views Cryptology» more  CISC 2007»
15 years 3 months ago
Deniable Authentication on the Internet
Deniable authentication is a technique that allows one party to send messages to another while the latter can not prove to a third party the fact of communication. In this paper, w...
Shaoquan Jiang
PET
2004
Springer
15 years 3 months ago
Reputable Mix Networks
We define a new type of mix network that offers a reduced form of robustness: the mixnet can prove that every message it outputs corresponds to an input submitted by a player wit...
Philippe Golle
FSTTCS
2007
Springer
15 years 3 months ago
On Simulatability Soundness and Mapping Soundness of Symbolic Cryptography
Abstract. The abstraction of cryptographic operations by term algebras, called DolevYao models or symbolic cryptography, is essential in almost all tool-supported methods for provi...
Michael Backes, Markus Dürmuth, Ralf Küs...
CSFW
2010
IEEE
15 years 1 months ago
Impossibility Results for Secret Establishment
—Security protocol design is a creative discipline where the solution space depends on the problem to be solved and the cryptographic operators available. In this paper, we exami...
Benedikt Schmidt, Patrick Schaller, David A. Basin