Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Privacy amplification with asymptotically optimal entropy loss

From MaRDI portal
Publication:2875205
Jump to:navigation, search

DOI10.1145/1806689.1806796zbMath1293.94101OpenAlexW2007866204MaRDI QIDQ2875205

Bhavana Kanukurthi, Leonid Reyzin, Nishanth Chandran, Rafail Ostrovsky

Publication date: 13 August 2014

Published in: Proceedings of the forty-second ACM symposium on Theory of computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1806689.1806796


zbMATH Keywords

entropy lossprivacy amplificationinformation-theoretic key agreement


Mathematics Subject Classification ID

Authentication, digital signatures and secret sharing (94A62)


Related Items (4)

Privacy amplification from non-malleable codes ⋮ Computational fuzzy extractors ⋮ Privacy amplification with asymptotically optimal entropy loss ⋮ Unnamed Item




This page was built for publication: Privacy amplification with asymptotically optimal entropy loss

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2875205&oldid=15821053"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 3 February 2024, at 19:28.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki