It is known that the security evaluation can be done by smoothing of Rényi entropy of order 2 in the quantum setting when we apply universal2 hash functions. This fact can be extended to the case when we apply ε-almost dual universal2 hash functions, which is a generalized concept of universal2 hash functions. Demonstrating the smoothing of Rényi entropy of order 2, we derived security bounds for universal composability and mutual information criterion under the condition in the quantum setting. © Springer-Verlag Berlin Heidelberg 2013.
CITATION STYLE
Hayashi, M. (2013). Quantum security analysis via smoothing of Renyi entropy of order 2. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7582 LNCS, pp. 128–140). https://doi.org/10.1007/978-3-642-35656-8_11
Mendeley helps you to discover research relevant for your work.