Mihir Bellare, Phillip Rogaway  Home/Search
Context Related
| ucsd.edu/users/mihir/papers/ee.ps.gz 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: ucsd.edu/users/mihir/papers/ee (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We investigate the following approach to symmetric encryption: rst encode the message via some keyless transform, and then encipher the encoded message, meaning apply a permutation FK based on a shared key K. We provide conditions on the encoding functions and the cipher which ensure that the resulting encryption scheme meets strong privacy (eg. semantic security) and/or authenticity goals. The encoding can either be implemented in a simple way (eg. prepend a counter and append a... (Update)
Similar documents based on text: More All
0.4: Cryptanalysis: A survey of recent results - Brickel, Odlyzko (Correct)
0.2: Cv - Smith (Correct)
0.2: Efficiency and Security of Cryptosystems Based on Number Theory - Bleichenbacher (1996) (Correct)
BibTeX entry: (Update)
M. Bellare and P. Rogaway, \Encode-then-encipher encryption: How to exploit nonces or redundancy in plaintexts for ecient cryptography." Full version of this paper, available via http://www-cseucsd.edu/users/mihir. http://citeseer.ist.psu.edu/bellare00encodethenencipher.html More
@article{ bellare00encodethenencipher,
author = "Mihir Bellare and Phillip Rogaway",
title = "Encode-Then-Encipher Encryption: How to Exploit Nonces or Redundancy in Plaintexts for Efficient Cryptography",
journal = "Lecture Notes in Computer Science",
volume = "1976",
pages = "317--??",
year = "2000",
url = "citeseer.ist.psu.edu/bellare00encodethenencipher.html" }
Citations (may not include all citations):419 How to construct random functions (context) - Goldreich, Goldwasser et al. - 1986
404 Journal of Computer and System Sciences (context) - Goldwasser, Micali et al. - 1984
241 Communication theory of secrecy systems (context) - Shannon - 1949
173 How to construct pseudorandom permutations from pseudorandom.. (context) - Luby, Rackoff - 1988
159 A concrete security treatment of symmetric encryption (context) - Bellare, Desai et al. - 1997
114 Non-interactive zero-knowledge proof of knowledge and chosen.. (context) - Rackoff, Simon - 1991
97 The security of the cipher block chaining message authentica.. - Bellare, Kilian et al. - 2000
85 Authenticated encryption: Relations among notions and analys.. (context) - Bellare, Namprempre - 1976
77 the construction of pseudo-random permutations: Luby-Racko .. - Naor, Reingold - 1999
42 All-or-nothing encryption and the package transform - Rivest - 1997
31 Unforgeable encryption and adaptively secure modes of operat.. (context) - Katz, Yung - 2000
18 the construction of variable-input-length ciphers - Bellare, Rogaway - 1999
10 backwards: Increasing security by making block ciphers non-i.. (context) - Bellare, Krovetz et al. - 1998
2 Proceedings of the 23rd Annual Symposium on the Theory of Co.. (context) - Dolev, Dwork et al. - 1991
The graph only includes citing articles where the year of publication is known.
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