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

Hardness of non-interactive differential privacy from one-way functions

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

DOI10.1007/978-3-319-96884-1_15zbMath1444.94079OpenAlexW2795174080MaRDI QIDQ1673404

Lucas Kowalczyk, Tal Malkin, Daniel Wichs, Jonathan R. Ullman

Publication date: 12 September 2018

Full work available at URL: https://doi.org/10.1007/978-3-319-96884-1_15


zbMATH Keywords

differential privacy


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (5)

Dynamic collusion bounded functional encryption from identity-based encryption ⋮ Collusion-resistant functional encryption for RAMs ⋮ Collusion Resistant Traitor Tracing from Learning with Errors ⋮ Comparative study of differentially private data synthesis methods ⋮ New techniques for traitor tracing: size \(N^{1/3}\) and more from pairings







This page was built for publication: Hardness of non-interactive differential privacy from one-way functions

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