A communication-privacy tradeoff for modular addition-Reference-Cited by-同舟云学术

A communication-privacy tradeoff for modular addition

Published:1993-03 Issue:4 Volume:45 Page:205-210
ISSN:0020-0190
Container-title:Information Processing Letters
language:en
Short-container-title:Information Processing Letters

Author:

Chor Benny,Kushilevitz Eyal

Publisher

Elsevier BV

Subject

Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science

Reference9 articles.

1. Non-cryptographic fault-tolerant computing in a constant expected number of rounds of interaction;Beaver;Proc. 8th Ann. ACM Symp. on Principles of Distributed Computing,1989

2. Secret sharing homomorphisms: Keeping shares of a secret secret;Benaloh (Cohen),1987

3. Completeness theorems for non-cryptographic fault-tolerant distributed computation;Ben-or;Proc. 20th Ann. ACM Symp. on Theory of Computing,1989

4. Multiparty unconditionally secure protocols;Chaum;Proc. 20th Ann. ACM Symp. on Theory of Computing,1988

5. A zero-one law for boolean privacy;Chor;SIAM J. Discrete Math.,1991

Cited by 41 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. PrivaTree: Collaborative Privacy-Preserving Training of Decision Trees on Biomedical Data;IEEE/ACM Transactions on Computational Biology and Bioinformatics;2023

2. Information Theoretic Secure Aggregation With User Dropouts;IEEE Transactions on Information Theory;2022-11

3. Quantum verifiable protocol for secure modulo zero-sum randomness;Quantum Information Processing;2022-08-13

4. Tight Bounds on the Randomness Complexity of Secure Multiparty Computation;Advances in Cryptology – CRYPTO 2022;2022

5. Secure Modulo Sum via Multiple Access Channel;2021 IEEE International Symposium on Information Theory (ISIT);2021-07-12