Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol-Reference-Cited by-同舟云学术

Multiparty Computation for Interval, Equality, and Comparison Without Bit-Decomposition Protocol

Published: Issue: Volume: Page:343-360
ISSN:
Container-title:Public Key Cryptography – PKC 2007
language:
Short-container-title:

Author:

Nishide Takashi,Ohta Kazuo

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-540-71677-8_23.pdf

Reference25 articles.

1. Lecture Notes in Computer Science;J. Algesheimer,2002

2. Bar-Ilan, J., Beaver, D.: Non-cryptographic fault-tolerant computing in a constant number of rounds of interaction. In: Proc. ACM Symposium on Principles of Distributed Computing, pp. 201–209. ACM Press, New York (1989)

3. Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorem for non-cryptographic fault-tolerant distributed computation. In: 20th Annual ACM Symposium on Theory of Computing, pp. 1–10. ACM Press, New York (1988)

4. Lecture Notes in Computer Science;P. Bogetoft,2006

5. Lecture Notes in Computer Science;A.K. Chandra,1983

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

1. PEBASI: A Privacy preserving, Efficient Biometric Authentication Scheme based on Irises;ACM Transactions on Privacy and Security;2024-08-20

2. Towards Secure Virtual Elections: Multiparty Computation of Order Based Voting Rules;Proceedings of the 19th International Conference on Availability, Reliability and Security;2024-07-30

3. Secure Multi-Party Linear Algebra with Perfect Correctness;IACR Communications in Cryptology;2024-04-09

4. Efficient secure multi-party computation for proof of custody in Ethereum sharding;Designs, Codes and Cryptography;2024-03-27

5. Extremely Efficient and Privacy-Preserving MAX/MIN Protocol Based on Multiparty Computation in Big Data;IEEE Transactions on Consumer Electronics;2024-02