Sciweavers

127 search results - page 19 / 26
» Proving Properties of Security Protocols by Induction
Sort
View
TCC
2004
Springer
173views Cryptology» more  TCC 2004»
15 years 2 months ago
Soundness of Formal Encryption in the Presence of Active Adversaries
Abstract. We present a general method to prove security properties of cryptographic protocols against active adversaries, when the messages exchanged by the honest parties are arbi...
Daniele Micciancio, Bogdan Warinschi
CCS
2005
ACM
15 years 3 months ago
Provable anonymity
This paper provides a formal framework for the analysis of information hiding properties of anonymous communication protocols in terms of epistemic logic. The key ingredient is ou...
Flavio D. Garcia, Ichiro Hasuo, Wolter Pieters, Pe...
ESORICS
2009
Springer
15 years 10 months ago
Reliable Evidence: Auditability by Typing
Abstract. Many protocols rely on audit trails to allow an impartial judge to verify a posteriori some property of a protocol run. However, in current practice the choice of what da...
Nataliya Guts, Cédric Fournet, Francesco Za...
73
Voted
TCC
2005
Springer
115views Cryptology» more  TCC 2005»
15 years 3 months ago
The Universal Composable Security of Quantum Key Distribution
The existing unconditional security definitions of quantum key distribution (QKD) do not apply to joint attacks over QKD and the subsequent use of the resulting key. In this paper...
Michael Ben-Or, Michal Horodecki, Debbie W. Leung,...
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
15 years 10 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...