ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1311.5322
  4. Cited By
More Efficient Privacy Amplification with Less Random Seeds via Dual
  Universal Hash Function
v1v2v3v4v5 (latest)

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

21 November 2013
Masahito Hayashi
T. Tsurumaru
ArXiv (abs)PDFHTML

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

18 / 18 papers shown
Title
An efficient construction of Raz's two-source randomness extractor with improved parameters
An efficient construction of Raz's two-source randomness extractor with improved parameters
Cameron Foreman
Lewis Wooltorton
Kevin Milner
Florian J. Curchod
26
1
0
18 Jun 2025
Improved Two-source Extractors against Quantum Side Information
Jakob Miller
Martin Sandfuchs
Carla Ferradini
57
1
0
07 Mar 2025
Nearly-Linear Time Seeded Extractors with Short Seeds
Nearly-Linear Time Seeded Extractors with Short Seeds
Dean Doron
João Ribeiro
23
1
0
12 Nov 2024
Cryptomite: A versatile and user-friendly library of randomness
  extractors
Cryptomite: A versatile and user-friendly library of randomness extractors
Cameron Foreman
Richie Yeung
A. Edgington
Florian J. Curchod
55
6
0
13 Feb 2024
A universal whitening algorithm for commercial random number generators
A universal whitening algorithm for commercial random number generators
Avval Amil
Shashank Gupta
29
2
0
25 Aug 2022
Hashing Learning with Hyper-Class Representation
Hashing Learning with Hyper-Class Representation
Shi-bo Zhang
Jiaye Li
72
1
0
06 Jun 2022
Optimal Second-Order Rates for Quantum Soft Covering and Privacy
  Amplification
Optimal Second-Order Rates for Quantum Soft Covering and Privacy Amplification
Yunyi Shen
Li Gao
Hao-Chung Cheng
47
19
0
23 Feb 2022
Secure uniform random number extraction via incoherent strategies
Secure uniform random number extraction via incoherent strategies
Masahito Hayashi
Huangjun Zhu
36
18
0
13 Jun 2017
(Quantum) Min-Entropy Resources
(Quantum) Min-Entropy Resources
Christopher Portmann
43
2
0
30 May 2017
Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance
  Quantum Cryptography
Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography
Mario Milicevic
Chen Feng
Lei M. Zhang
P. G. Gulak
33
110
0
24 Feb 2017
Universal Construction of Cheater-Identifiable Secret Sharing Against
  Rushing Cheaters Based on Message Authentication
Universal Construction of Cheater-Identifiable Secret Sharing Against Rushing Cheaters Based on Message Authentication
Masahito Hayashi
Takeshi Koshiba
23
6
0
16 Jan 2017
Information-theoretic Physical Layer Security for Satellite Channels
Information-theoretic Physical Layer Security for Satellite Channels
M. Vázquez-Castro
Masahito Hayashi
30
9
0
24 Oct 2016
Analysis of Remaining Uncertainties and Exponents under Various
  Conditional Rényi Entropies
Analysis of Remaining Uncertainties and Exponents under Various Conditional Rényi Entropies
Vincent Y. F. Tan
Masahito Hayashi
45
16
0
31 May 2016
Finite-Block-Length Analysis in Classical and Quantum Information Theory
Finite-Block-Length Analysis in Classical and Quantum Information Theory
Masahito Hayashi
30
9
0
10 May 2016
Quantum-proof multi-source randomness extractors in the Markov model
Quantum-proof multi-source randomness extractors in the Markov model
Rotem Arnon Friedman
Christopher Portmann
V. Scholz
52
21
0
22 Oct 2015
Equivocations, Exponents and Second-Order Coding Rates under Various
  Rényi Information Measures
Equivocations, Exponents and Second-Order Coding Rates under Various Rényi Information Measures
Masahito Hayashi
Vincent Y. F. Tan
68
30
0
10 Apr 2015
Uniform Random Number Generation from Markov Chains: Non-Asymptotic and
  Asymptotic Analyses
Uniform Random Number Generation from Markov Chains: Non-Asymptotic and Asymptotic Analyses
Masahito Hayashi
Shun Watanabe
74
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
Security analysis of epsilon-almost dual universal2 hash functions: smoothing of min entropy vs. smoothing of Rényi entropy of order 2
Masahito Hayashi
126
33
0
06 Sep 2013
1