article

A zero-one law for Boolean privacy

Authors:

Benny Chor,

Eyal KushilevitzAuthors Info & Claims

SIAM Journal on Discrete Mathematics, Volume 4, Issue 1

Pages 36 - 47

https://doi.org/10.1137/0404004

Published: 02 January 1991 Publication History

Abstract

No abstract available.

Cited By

View all

Malekzadeh MKawsar FXu CDavies N(2024)Salted Inference: Enhancing Privacy while Maintaining Efficiency of Split Inference in Mobile ComputingProceedings of the 25th International Workshop on Mobile Computing Systems and Applications10.1145/3638550.3641131(14-20)Online publication date: 28-Feb-2024
https://dl.acm.org/doi/10.1145/3638550.3641131
Cianciullo LGhodosi H(2022)Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New ResultsJournal of Computer Science and Technology10.1007/s11390-022-0878-637:2(443-458)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11390-022-0878-6
Couteau GRosén A(2022)Random Sources in Private ComputationAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_15(443-473)Online publication date: 5-Dec-2022
https://dl.acm.org/doi/10.1007/978-3-031-22963-3_15
Show More Cited By

Index Terms

A zero-one law for Boolean privacy
1. Mathematics of computing
  1. Discrete mathematics
2. Security and privacy
  1. Systems security
    1. Operating systems security

Recommendations

Internet privacy law: a comparison between the United States and the European Union

The increasing use of personal information in Internet-based applications has created privacy concerns worldwide. This has led to awareness among policy makers in several countries of the desirability of harmonizing privacy laws. The greatest challenge ...
Issues In Internet Law: Society, Technology, and the Law 11th edition
Law of the Internet

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image SIAM Journal on Discrete Mathematics

SIAM Journal on Discrete Mathematics Volume 4, Issue 1

Feb. 1991

149 pages

ISSN:0895-4801

Editor:
W. T. Trotter

Issue’s Table of Contents

Publisher

Society for Industrial and Applied Mathematics

United States

Publication History

Published: 02 January 1991

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

61
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 13 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Malekzadeh MKawsar FXu CDavies N(2024)Salted Inference: Enhancing Privacy while Maintaining Efficiency of Split Inference in Mobile ComputingProceedings of the 25th International Workshop on Mobile Computing Systems and Applications10.1145/3638550.3641131(14-20)Online publication date: 28-Feb-2024
https://dl.acm.org/doi/10.1145/3638550.3641131
Cianciullo LGhodosi H(2022)Unconditionally Secure Oblivious Polynomial Evaluation: A Survey and New ResultsJournal of Computer Science and Technology10.1007/s11390-022-0878-637:2(443-458)Online publication date: 1-Apr-2022
https://dl.acm.org/doi/10.1007/s11390-022-0878-6
Couteau GRosén A(2022)Random Sources in Private ComputationAdvances in Cryptology – ASIACRYPT 202210.1007/978-3-031-22963-3_15(443-473)Online publication date: 5-Dec-2022
https://dl.acm.org/doi/10.1007/978-3-031-22963-3_15
Goyal SNarayanan VPrabhakaran M(2022)Oblivious-Transfer Complexity of Noisy Coin-Toss via Secure Zero Communication ReductionsTheory of Cryptography10.1007/978-3-031-22368-6_4(89-118)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22368-6_4
Alon BNissenbaum OOmri EPaskin-Cherniavsky APatra A(2022)On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated RandomnessTheory of Cryptography10.1007/978-3-031-22365-5_19(532-561)Online publication date: 7-Nov-2022
https://dl.acm.org/doi/10.1007/978-3-031-22365-5_19
Malekzadeh MBorovykh AGündüz DKim YKim JVigna GShi E(2021)Honest-but-Curious Nets: Sensitive Attributes of Private Inputs Can Be Secretly Coded into the Classifiers' OutputsProceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security10.1145/3460120.3484533(825-844)Online publication date: 12-Nov-2021
https://dl.acm.org/doi/10.1145/3460120.3484533
Narayanan VPrabhakaran MPrabhakaran V(2020)Zero-Communication ReductionsTheory of Cryptography10.1007/978-3-030-64381-2_10(274-304)Online publication date: 16-Nov-2020
https://dl.acm.org/doi/10.1007/978-3-030-64381-2_10
Goldreich O(2019)On the foundations of cryptographyProviding Sound Foundations for Cryptography10.1145/3335741.3335759(411-496)Online publication date: 4-Oct-2019
https://dl.acm.org/doi/10.1145/3335741.3335759
Kushilevitz EOstrovsky RProuff ERosén AThillard AVergnaud D(2019)Lower and Upper Bounds on the Randomness Complexity of Private Computations of ANDTheory of Cryptography10.1007/978-3-030-36033-7_15(386-406)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-36033-7_15
Halevi SIshai YKushilevitz EMakriyannis NRabin T(2019)On Fully Secure MPC with Solitary OutputTheory of Cryptography10.1007/978-3-030-36030-6_13(312-340)Online publication date: 1-Dec-2019
https://dl.acm.org/doi/10.1007/978-3-030-36030-6_13
Show More Cited By

Abstract

Cited By

Index Terms

Recommendations

Internet privacy law: a comparison between the United States and the European Union

Issues In Internet Law: Society, Technology, and the Law 11th edition

Law of the Internet

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations