A cost-effective pay-per-multiplication comparison method for millionaires

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2020, Issue , 2001, Pages 457-471

  Fischlin, Marc ^a  

^a GOETHE UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CRYPTOGRAPHY;

COMPARISON METHODS; COST EFFECTIVE; MODULAR MULTIPLICATION; OBLIVIOUS TRANSFER;

COST EFFECTIVENESS;

EID: 84937542853     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45353-9_33     Document Type: Conference Paper

References (20)

1. D. Beaver: Minimal-Latency Secure Function Evaluation, Eurocrypt 2000, Lecture Notes in Computer Science, Vol. 1807, Springer-Verlag, pp. 335-350, 2000.
2. F. Boudot, B. Schoenmakers, J. Traorffe: A Fair and Efficient Solution to the Socialist Millionaires' Problem, to appear in Discrete Applied Mathematics, Special Issue on Coding and Cryptography, Elsevier, 2000.
3. C. Cachin: Efficient Private Bidding and Auctions with an Oblivious Third Party, 6th ACM Conference on Computer and Communications Security, pp. 120-127, 1999.
4. C. Cachin, J. Camenish: Optimistic Fair Secure Computations, Crypto 2000, Lecture Notes in Computer Science, Vol. 1880, Springer-Verlag, pp. 93-111, 2000.
5. C. Cachin, J. Camenish, J. Kilian, J. Müller: One-Round Secure Computation and Secure Autonomous Mobile Agents, ICALP 2000, Lecture Notes in Computer Science, Springer-Verlag, 2000.
6. R. Canetti: Security and Composition of Multiparty Cryptographic Protocols, Journal of Cryptology, Vol. 13, No. 1, Springer-Verlag, pp. 143-202, 2000.
7. G. Di Crescenzo, R. Ostrovsky, S. Rajagopalan: Conditional Oblivious Transfer and Time-Release Encryption, Eurocrypt '99, Lecture Notes in Computer Science, Vol. 1592, Springer-Verlag, pp. 74-89, 1999.
8. U. Feige, A. Fiat, A. Shamir: Zero-Knowledge Proofs of Identity, Journal of Cryptology, Vol. 1, No. 2, pp. 77-94, Springer-Verlag, 1988.
9. O. Goldreich: Secure Multi-Party Computation, (working draft, version 1. 2), available at http://www. wisdom. weizmann. ac. il/home/oded/public html/pp. html, March 2000.
10. O. Goldreich, S. Micali, A. Wigderson: How to Play any Mental Game |or| a Completeness Theorem for Protocols with Honest Majorities, Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pp. 218-229, 1987.
11. O. Goldreich, S. Micali, A. Wigderson: Proofs That Yield Nothing About Their Validity |or| All Languages in NP Have Zero-Knowledge Proof Systems, Journal of the ACM, Vol. 8, No. 1, pp. 691-729, 1991.
12. S. Goldwasser, S. Micali: Probabilistic Encryption, Journal of Computer and System Sciences, Vol. 28(2), pp. 270-299, 1984.
13. S. Goldwassser, S. Micali, C. Rackoff: The Knowledge Complexity of Interactive Proof Systems, SIAM Journal on Computation, Vol. 18, pp. 186-208, 1989.
14. G. Hardy, E. Wright: An Introduction to the Theory of Numbers, Oxford University Press, 1979.
15. M. Jakobsson, M. Yung: Proving Without Knowing: On Oblivious, Agnostic and Blindfolded Provers, Crypto '96, Lecture Notes in Computer Science, Vol. 1109, Springer-Verlag, pp. 186-200, 1996.
16. M. Naor, B. Pinkas, R. Sumner: Privacy Preserving Auctions and Mechanism Design, 1st ACM Conference on Electronic Commerce, available at http://www. wisdom. weizmann. ac. il/~bennyp/, 1999.
17. M. Rabin: How to Exchange Secrets by Oblivious Transfer, Technical Report TR-81, Harvard, 1981.
18. T. Sander, A. Young, M. Yung: Non-Interactive Crypto-Computing for NC1, Proceedings of the 40th IEEE Symposium on Foundations of Computer Science (FOCS), 1999.
19. A. Yao: Protocols for Secure Computation, Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 160-164, 1982.
20. A. Yao: How to Generate and Exchange Secrets, Proceedings of the 27th IEEE Symposium on Foundations of Computer Science (FOCS), pp. 162-167, 1986.