More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function

21 November 2013

Papers citing "More Efficient Privacy Amplification with Less Random Seeds via Dual Universal Hash Function"

11 / 11 papers shown

Title
Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses Masahito Hayashi Shun Watanabe 36 37 0 15 Mar 2015
Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2 Masahito Hayashi 58 33 0 06 Sep 2013
Non-Asymptotic Analysis of Privacy Amplification via Renyi Entropy and Inf-Spectral Entropy Shun Watanabe Masahito Hayashi 39 40 0 22 Nov 2012
Secure Multiplex Coding with Dependent and Non-Uniform Multiple Messages Masahito Hayashi R. Matsumoto 68 101 0 07 Feb 2012
Precise evaluation of leaked information with universal2 privacy amplification in the presence of quantum attacker Masahito Hayashi 76 32 0 03 Feb 2012
Large deviation analysis for quantum security via smoothing of Renyi entropy of order 2 Masahito Hayashi 56 45 0 01 Feb 2012
Tight exponential analysis of universally composable privacy amplification and its applications Masahito Hayashi 77 77 0 07 Oct 2010
Trevisan's extractor in the presence of quantum side information Anindya De Christopher Portmann Thomas Vidick R. Renner 77 143 0 30 Dec 2009
The discrete logarithm problem in the group of non-singular circulant matrices A. Mahalanobis 67 16 0 19 May 2009
Exponential decreasing rate of leaked information in universal random privacy amplification Masahito Hayashi 75 259 0 02 Apr 2009
Randomness Extraction via Delta-Biased Masking in the Presence of a Quantum Attacker Serge Fehr Christian Schaffner 298 39 0 18 Jun 2007