Name
Abstract | ||
|---|---|---|
Remotely keyed encryption (RKE) schemes provide fast symmetric encryption and decryption using a small-bandwidth security module and a powerful host. Such schemes keep the key inside the security module to prevent key compromise. Shin, Shin, and Rhee proposed a length-preserving as well as a length-increasing RKE scheme that both use only a single round of interaction between host and security module. With the length-preserving scheme they claim to answer an open problem of Blaze, Feigenbaum, and Naor. However, in the present paper we show that both their schemes are completely insecure. Further, we present heuristic arguments on why a one-round length-preserving RKE scheme might be impossible. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.1016/j.ipl.2007.08.026 | Inf. Process. Lett. |
Keywords | Field | DocType |
powerful host,length-increasing rke scheme,present paper,keyed encryption scheme,rke scheme,security module,small-bandwidth security module,length-preserving scheme,symmetric encryption,keyed encryption,key compromise,cryptanalysis,cryptography | Symmetric-key algorithm,Heuristic,Open problem,Computer security,Cryptography,Cryptanalysis,Encryption,Heuristics,Bandwidth (signal processing),Mathematics | Journal |
Volume | Issue | ISSN |
105 | 6 | 0020-0190 |
Citations | PageRank | References |
0 | 0.34 | 5 |
Authors | ||
1 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Ulrich Kühn | 1 | 94 | 13.58 |