Name
Title | ||
|---|---|---|
Lower Bounds for Key Length of k-wise Almost Independent Permutations and Certain Symmetric-Key Encryption Schemes. |
Abstract | ||
|---|---|---|
The k-wise almost independent permutations are one of important primitives for cryptographic schemes and combinatorial constructions. Kaplan, Naor, and Reingold showed a general construction for k-wise almost independent permutations, and Kawachi, Takebe, and Tanaka provided symmetric-key encryption schemes that achieve multi-message approximate secrecy and multi-ciphertext approximate non-malleability based on Kaplan et al.' s construction. In this paper, we show lower bounds of key length for these constructions. In particular, they are nearly optimal for k-wise almost independent permutations and multi-message approximate secrecy if the approximation parameter is a constant. |
Year | DOI | Venue |
|---|---|---|
2016 | 10.1007/978-3-319-44524-3_12 | ADVANCES IN INFORMATION AND COMPUTER SECURITY, IWSEC 2016 |
Keywords | Field | DocType |
k-wise almost independent permutations,Symmetric-key encryption schemes,Approximate secrecy,Non-malleability | Symmetric-key algorithm,Discrete mathematics,Computer security,Computer science,Cryptography,Secrecy,Permutation,Encryption,Probabilistic encryption,Key size,Distributed computing | Conference |
Volume | ISSN | Citations |
9836 | 0302-9743 | 0 |
PageRank | References | Authors |
0.34 | 8 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Akinori Kawachi | 1 | 185 | 20.66 |
| Hirotoshi Takebe | 2 | 0 | 0.34 |
| Keisuke Tanaka | 3 | 54 | 12.51 |