Gergei Bana, Payman Mohassel, and Till Stegers  Home/Search
Context
Related
| iacr.org/2006/323.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: iacr.org/2006/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: In the research of the relationship between the formal and the computational view of cryptography, a recent approach, first proposed in [9], uses static equivalence from cryptographic pi calculi as a notion of formal indistinguishability. Previous work [9, 1] has shown that this yields the soundness of natural interpretations of some interesting equational theories, such as certain cryptographic operations and a theory of XOR. In this paper however, we argue that static equivalence is too... (Update)
Active bibliography (related documents): More All
0.9: A Computationally Sound Mechanized Prover for Security Protocols - Blanchet (2005) (Correct)
0.7: Key Confirmation and Adaptive Corruptions - In The Protocol (2006) (Correct)
0.6: Key Exchange Protocols: Security Definition, Proof.. - Datta, Derek.. (2006) (Correct)
Similar documents based on text:
6.0: Unknown - (Correct)
BibTeX entry: (Update)
@misc{ cryptoeprint:2006:323,
author = {Gergei Bana and Payman Mohassel and Till Stegers},
title = {Computational Soundness of Formal Indistinguishability and Static Equivalence},
howpublished = {Cryptology ePrint Archive, Report 2006/323},
year = {2006},
note = {\url{http://eprint.iacr.org/}},
url = {citeseer.ist.psu.edu/bana06computational.html} }
Citations (may not include all citations):404 A calculus for cryptographic protocols: The Spi Calculus - Abadi, Gordon
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
254 A practical public key cryptosystem provably secure against .. - Cramer, Shoup
189 Universally composable security: A new paradigm for cryptogr.. - Canetti
76 the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2002
41 i and C. Fournet. Mobile values, new names, and secure commu.. (context) - Abad - 2001
34 A composable cryptographic library with nested operations - Backes, Pfitzmann et al.
28 The faithfulness of abstract protocol analysis: Message auth.. (context) - Guttman, Thayer et al. - 2001
22 Symmetric encryption in a simulatable Dolev-Yao style crypto.. - Backes, Pfitzmann
21 Soundness of formal encryption in the presence of active adv.. (context) - Micciancio, Warinschi - 2004
21 Symmetric encryption in automatic analyses for confidentiali.. - Laud
16 Completeness theorems for the Abadi-Rogaway logic of encrypt.. (context) - Micciancio, Warinschi - 2004
6 Computationally sound implementations of equational theories.. - Baudet, Cortier et al. - 2005
3 Computational and information-theoretic soundness and comple.. (context) - Adao, Bana et al. - 2005
3 Universally composable symbolic analysis of mutual authentic.. (context) - Canetti, Herzog - 2006
2 Encryption cycles and two views of cryptography - Laud - 2002
2 Soundness of formal encryption in the presence of key-cycles (context) - Adao, Bana et al. - 2005
1 Preliminary version presented at STOC (context) - Goldwasser, Micali et al. - 1984
1 Guessing attacks and the computational soundness of static e.. (context) - Abadi, Baudet et al. - 2006
Documents on the same site (http://eprint.iacr.org/2006/): More
Simplified Pairing Computation and Security Implications - Galbraith, hEigeartaigh.. (2006) (Correct)
Cryptanalysis of an Image Scrambling Scheme without.. - Li, Li, Lo, Chen (2006) (Correct)
Non-Trivial Black-Box Combiners for Collision-Resistant.. - Pietrzak (2006) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC