John Black, Phillip Rogaway  Home/Search
Context Related
| ucdavis.edu/~rogaway/papers...subset.ps 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: ucdavis.edu/~rogaway/pape...index (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We explore the problem of enciphering members of a nite set M where k = jMj is arbitrary (in particular, it need not be a power of two). We want to achieve this goal starting from a block cipher (which requires a message space of size N = 2 n , for some n). We look at a few solutions to this problem, focusing on the case when M = [0; k 1]. We see ciphers with arbitrary domains as a worthwhile primitive in its own right, and as a potentially useful one for making higher-level protocols. (Update)
Context of citations to this paper: More
.... be in doubt [15] it employs any extant block cipher, some of which have withstood extended cryptanalytic scrutiny [27] Black and Rogaway [5] present three methods for encrypting an arbitrary finite domain, using constructions based on any extant block cipher. However, without...
Cited by: More
Weaknesses in two group Die-Hellman key - Exchange Protocols Qiang (2005) (Correct)
Modes of Operation of a Block Cipher - Preneel (Correct)
This Extended Appears in: - December Queenstown New-Zealand (Correct)
Similar documents (at the sentence level):
58.3%: Ciphers with Arbitrary Finite Domains - May (2000) (Correct)
Active bibliography (related documents): More All
0.2: On the Round Security of Symmetric-Key Cryptographic Primitives - Ramzan, Reyzin (2000) (Correct)
0.2: Report on the AES Candidates - Baudron, Gilbert, Granboulan.. (1999) (Correct)
0.2: Scramble All, Encrypt Small - Jakobsson, Stern, Yung (1999) (Correct)
System load high. Please wait...
Timeout. Please try your query later.
Similar documents based on text: More All
1.0: Encryption-Scheme Security in the Presence of.. - Black, Rogaway, Shrimpton (2002) (Correct)
1.0: OCB: A Block-Cipher Mode of Operation for Efficient.. - Rogaway, Bellare.. (2001) (Correct)
1.0: CBC MACs for Arbitrary-Length Messages: The Three-Key.. - Black, Rogaway (2000) (Correct)
Related documents from co-citation: More All
8: Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval et al.
8: Encrypted Key Exchange: Password-Based Protocols Secure Against Dictionary Attac.. - Bellovin, Merritt - 1992
8: Provably Secure Password Authenticated Key Exchange Using Diffie Hellman - Boyko, MacKenzie et al. - 2000
BibTeX entry: (Update)
J. Black and P. Rogaway. Ciphers with Arbitrary Finite Domains. Manuscript, 2000. http://citeseer.ist.psu.edu/black00ciphers.html More
@inproceedings{ black02ciphers,
author = "John Black and Phillip Rogaway",
title = "Ciphers with Arbitrary Finite Domains",
booktitle = "{CT}-{RSA}",
pages = "114-130",
year = "2002",
url = "citeseer.ist.psu.edu/black00ciphers.html" }
Citations (may not include all citations):501 A digital signature scheme secure against adaptive chosen-me.. - Goldwasser, Micali et al. - 1988
419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988
150 Encrypted key exchange: password-based protocols secure agai.. - Bellovin, Merritt
97 Pseudorandomness and cryptographic applications (context) - Luby - 1996
97 The security of the cipher block chaining message authentica.. - Bellare, Kilian et al. - 2000
77 the construction of pseudorandom permutations: Luby-Racko r.. - Naor, Reingold - 1999
50 Two practical and provably secure block ciphers: BEAR and LI.. - Anderson, Biham - 1996
18 the construction of variable-input-length ciphers - Bellare, Rogaway - 1999
11 SEC1: Elliptic curve cryptography (context) - Research, ecient - 2000
5 Faster Luby-Racko ciphers (context) - Lucks - 1996
4 Introduction to the hasty pudding cipher (context) - Schroeppel, Orman - 1998
4 Towards making Luby-Racko ciphers optimal and practical (context) - Patel, Ramzan et al. - 1999
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.ucdavis.edu/~rogaway/papers/index.html): More
On the Construction of Variable-Input-Length Ciphers - Bellare, Rogaway (1999) (Correct)
Authenticated Key Exchange Secure Against Dictionary Attacks - Bellare, Pointcheval.. (2000) (Correct)
Reconciling Two Views of Cryptography (The Computational.. - Abadi, Rogaway (2000) (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