Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification

DOI10.1137/130908634zbMath1302.94040OpenAlexW1968711647MaRDI QIDQ5494925

Gil Cohen, Gil Segev, Ran Raz

Publication date: 30 July 2014

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/130908634

zbMATH Keywords

extractorsprivacy amplificationnonmalleable extractors

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Cryptography (94A60) Theory of computing (68Q99)

Related Items (7)

Privacy amplification from non-malleable codes ⋮ Extractors: low entropy requirements colliding with non-malleability ⋮ Nonmalleable Extractors and Codes, with Their Many Tampered Extensions ⋮ Privacy amplification with asymptotically optimal entropy loss ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Explicit two-source extractors and resilient functions

This page was built for publication: Nonmalleable Extractors with Short Seeds and Applications to Privacy Amplification