Information theoretic security for encryption based on conditional rényi entropies

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 8317 LNCS, Issue , 2014, Pages 103-121

  Iwamoto, Mitsugu ^a   Shikata, Junji ^b  

^a UNIVERSITY OF ELECTRO COMMUNICATIONS   (Japan)

^b YOKOHAMA NATIONAL UNIVERSITY   (Japan)

Author keywords

(Conditional) R nyi entropy; Error probability in guessing; Impossibility; Information theoretic cryptography; Symmetric key encryption

Indexed keywords

CRYPTOGRAPHY; ENTROPY; INFORMATION THEORY; PROBABILITY;

ERROR PROBABILITIES; IMPOSSIBILITY; INFORMATION- THEORETIC SECURITIES; INFORMATION-THEORETIC CRYPTOGRAPHY; PERFECT SECRECY; SECURITY CRITERION; SYMMETRIC KEY ENCRYPTION; SYMMETRIC KEYS;

SECURITY OF DATA;

EID: 84958540075     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-319-04268-8_7     Document Type: Conference Paper

References (33)

1. Iwamoto, M., Shikata, J.: Information theoretic security for encryption based on conditional Renyi entropies. IACR Cryptology ePrint Archive, 2013/440 (2013)
2. Shannon, C.: A mathematical theory of communication. Bell Syst. Tech. J. 27(3), 379-423 (1948)
3. Hartley, R.V.L.: Transmission of information. Bell Syst. Tech. J. 7(3), 535-563 (1928)
4. Haståd, J., Impagliazzo, R., Levin, L.A., Luby, M.: A pseudorandom generator from one-way function. SIAM J. Comput. 22, 1364-1396 (1994)
5. Shannon, C.E.: Communication theory of secrecy systems. Bell Tech. J. 28, 656-715 (1949)
6. Dodis, Y.: Shannon impossibility, revisited. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 100-110. Springer, Heidelberg (2012)
7. Alimomeni, M., Safavi-Naini, R.: Guessing secrecy. In: Smith, A. (ed.) ICITS 2012. LNCS, vol. 7412, pp. 1-13. Springer, Heidelberg (2012)
8. Rényi, A.: On measures of information and entropy. In: Proceedings of the 4th Berkeley Symposium on Mathematics, Statistics and Probability, pp. 547-561 (1961)
9. Teixeira, A., Matos, A., Antunes, L.: Conditional Rényi entropies. IEEE Trans. Inf. Theory 58(7), 4273-4277 (2012)
10. Arimoto, S.: Information measures and capacity of order α for discrete memoryless channels. Colloquia Mathematica Societatis János Bolyai, 16. Topics in Information Theory 41-52 (1975)
11. Hayashi, M.: Exponential decreasing rate of leaked information in universal random privacy amplification. IEEE Trans. Inf. Theory 57(6), 3989-4001 (2011)
12. Fano, R.M.: Class notes for transmission of information (course 6.574). Technical report, MIT, Cambridge. (1952)
13. Polyanskiy, Y., Poor, V., Verdú, S.: Channel coding rate in the finite blocklength regime. IEEE Trans. Inf. Theory 56(5), 2307-2359 (2010)
14. Polyanskiy, Y., Verdú, S.: Arimoto channel coding converse and Rényi divergence. In: Forty-Eighth Annual Allerton Conference, pp. 1327-1333 (2010)
15. Cachin, C.: Entropy measures and unconditional security in cryptography. Ph.D. thesis, Swiss Federal Institute of Technology, Zürich, Switzerland (1997)
16. Jizba, P., Arimitsu, T.: Generalized statistics: yet another generalization. Phys. A 340, 110-116 (2004)
17. Jizba, P., Arimitsu, T.: The world according to Rényi: thermodynamics of multifractal systems. Ann. Phys. 312, 17-59 (2004) (Pubitemid 38939247)
18. Renner, R.S., Wolf, S.: Simple and tight bounds for information reconciliation and privacy amplification. In: Roy, B. (ed.) ASIACRYPT 2005. LNCS, vol. 3788, pp. 199-216. Springer, Heidelberg (2005) (Pubitemid 43763476)
19. Hayashi, M.: Tight exponential analysis of universally composable privacy amplification and its applications. arXiv:1010.1358 (2010)
20. Stinson, D.R.: Cryptography: Theory and Practice, 3rd edn. Chapman & Hall/CRC, Boca Raton (2005)
21. Cover, T.M., Thomas, J.A.: Elements of Information Theory, 2nd edn. Wiley and Interscience, Hoboken (2006)
22. Fujishige, S.: Polymatroidal dependence structure of a set of random variables. Inf. Control 39, 55-72 (1978) (Pubitemid 9408951)
23. Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) EUROCRYPT 2004. LNCS, vol. 3027, pp. 523-540. Springer, Heidelberg (2004)
24. Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232-250. Springer, Heidelberg (2006) (Pubitemid 44532119)
25. Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. SIAM J. Comput. 38(1), 97-139 (2008)
26. Dodis, Y., Katz, J., Reyzin, L., Smith, A.: Robust fuzzy extractors and authenticated key agreement from close secrets. In: Dwork, C. (ed.) CRYPTO 2006. LNCS, vol. 4117, pp. 232-250. Springer, Heidelberg (2006) (Pubitemid 44532119)
27. Dodis, Y., Yu, Y.: Overcoming weak expectations. In: Sahai, A. (ed.) TCC 2013. LNCS, vol. 7785, pp. 1-22. Springer, Heidelberg (2013)
28. Katzenbeisser, S., Kocabaş, U., Rozić, V., Sadeghi, A.-R., Verbauwhede, I.,Wachsmann, C.: PUFs: myth, fact or busted? a security evaluation of physically unclonable functions (PUFs) cast in silicon. In: Prouff, E., Schaumont, P. (eds.) CHES 2012. LNCS, vol. 7428, pp. 283-301. Springer, Heidelberg (2012)
29. Arikan, E.: An inequality on guessing and its application to sequential decoding. IEEE Trans. Inf. Theory 42(1), 99-105 (1996) (Pubitemid 126775660)
30. Koga, H.: New coding theorems for fixed-length source coding and Shannon's cipher system with a general source. In: ISITA2008, pp. 251-256, December 2008
31. Han, T.S.: Information-Spectrum Methods in Information Theory. Springer-Verlag, Heidelberg (2003)
32. Renner, R., Wolf, S.: Smooth Rényi entropy and its applications. In: ISIT2004, p. 232, June-July, 2004
33. Tomamichel, M., Hayashi, M.: A hierarchy of information quantities for finite block length analysis of quantum tasks. arXiv:1208.1478 (2012)