Peeter Laud, Ricardo Corin  Home/Search
Context Related
| cs.ut.ee/~peeter_l/re...icisc2003.ps.gz From: cs.ut.ee/~peeter_l/research/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: The formal and computational views of cryptography have been related by the seminal work of Abadi and Rogaway. In their work, a formal treatment of encryption that uses atomic keys is justified in the computational world. However, many proposed formal approaches allow the use of composed keys, where any arbitrary expression can be used as encryption key. In this paper we consider an extension of the formal model presented by Abadi and Rogaway, in which it is allowed to use composed keys... (Update)
Cited by: More
Random polynomial-time attacks and Dolev-Yao models - Baudet (2004) (Correct)
Active bibliography (related documents): More All
0.5: Towards a Metalogic for Security Protocol Analysis.. - Caleiro, Vigano, Basin (Correct)
0.5: Computational Soundness of Formal Indistinguishability.. - Bana, Mohassel, Stegers (2006) (Correct)
0.2: A remark on the security of RMAC in the related-key.. - Jaulmes, Joux, Valette (Correct)
Similar documents based on text:
0.8: Encryption Cycles and Two Views of Cryptography - Laud (2002) (Correct)
BibTeX entry: (Update)
P. Laud. Sound computational interpretation of formal encryption with composed keys. In Proc. 6th International Conference on Information Security and Cryptology (ICISC). KIISC, 2003. http://citeseer.ist.psu.edu/laud03sound.html More
@misc{ laud03sound,
author = "P. Laud",
title = "Sound computational interpretation of formal encryption with composed keys",
text = "P. Laud. Sound computational interpretation of formal encryption with composed
keys. In Proc. 6th International Conference on Information Security and
Cryptology (ICISC). KIISC, 2003.",
year = "2003",
url = "citeseer.ist.psu.edu/laud03sound.html" }
Citations (may not include all citations):659 Random oracles are practical: A paradigm for designing e#cie.. - Bellare, Rogaway - 1993
317 IEEE Transactions on Information Theory (context) - Dolev, Yao et al. - 1983
263 The inductive approach to verifying cryptographic protocols - Paulson - 1998
164 ACM Transactions on Computer Systems (context) - Burrows, Abadi et al. - 1990
76 the computational soundness of formal encryption (context) - Abadi, Rogaway et al. - 2000
56 Formal eavesdropping and its computational interpretation - Abadi, Jurjens - 2001
47 Constraint solving for bounded-process cryptographic protoco.. - Millen, Shmatikov - 2001
33 Semantics and program analysis of computationally secure inf.. - Laud - 2001
31 Practice-oriented provable security - Bellare - 1997
27 Using one-way functions for authentication - Gong - 1989
23 the foundations of modern cryptography - Goldreich - 1997
14 An Improved Constraint-based system for the verification of .. - Corin, Etalle - 2002
10 Completeness theorems for the abadi-rogaway language of encr.. - Micciancio, Warinschi
8 The ssl protocol (context) - Freier, Karlton et al.
8 A theoretical treatment of related-key attacks: Rka-prps (context) - Bellare, Kohno - 2003
7 Encryption scheme security in the presence of key-dependent .. - Black, Rogaway et al. - 2002
5 Private authentication - Abadi - 2003
2 Encryption cycles and two views of cryptography - Laud - 2002
2 erentiation: A new reduction technique for constraint-based .. (context) - Basin, Modersheim et al. - 2003
Documents on the same site (http://www.cs.ut.ee/~peeter_l/research/): More
Pseudorandom Permutations and Equivalence of Formal Expressions - Laud (2002) (Correct)
Encryption Cycles and Two Views of Cryptography - Laud (2002) (Correct)
Handling Encryption in an Analysis for Secure Information Flow - Laud (2003) (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