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

On the structure of the privacy hierarchy

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

DOI10.1007/BF00195209zbMath0794.94013OpenAlexW2074423381MaRDI QIDQ1324758

Eyal Kushilevitz, Mihály Geréb-Graus, Benny Chor

Publication date: 26 May 1994

Published in: Journal of Cryptology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf00195209


zbMATH Keywords

distributed computingargument functionprivacy hierarchyprivate functions


Mathematics Subject Classification ID

Cryptography (94A60)


Related Items (4)

The Hardness of Being Private ⋮ On the number of random bits in totally private computation ⋮ On Complete Primitives for Fairness ⋮ On privacy and partition arguments




Cites Work

  • Unnamed Item
  • Unnamed Item
  • How to share a secret
  • Privacy and Communication Complexity
  • Private Computations over the Integers
  • A Zero-One Law for Boolean Privacy




This page was built for publication: On the structure of the privacy hierarchy

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