A Cost-Effective Pay-Per-Multiplication Comparison Method for Millionaires
- 2 April 2001
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 457-471
- https://doi.org/10.1007/3-540-45353-9_33
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- Optimistic Fair Secure ComputationLecture Notes in Computer Science, 2000
- Security and Composition of Multiparty Cryptographic ProtocolsJournal of Cryptology, 2000
- Efficient private bidding and auctions with an oblivious third partyPublished by Association for Computing Machinery (ACM) ,1999
- Conditional Oblivious Transfer and Timed-Release EncryptionLecture Notes in Computer Science, 1999
- Proving Without Knowing: On Oblivious, Agnostic and Blindfolded ProversLecture Notes in Computer Science, 1996
- The Knowledge Complexity of Interactive Proof SystemsSIAM Journal on Computing, 1989
- Zero-knowledge proofs of identityJournal of Cryptology, 1988
- How to generate and exchange secretsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1986
- Probabilistic encryptionJournal of Computer and System Sciences, 1984
- Protocols for secure computationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1982