Efficient Two-Party Secure Computation on Committed Inputs
- 1 January 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 27 references indexed in Scilit:
- Practical Verifiable Encryption and Decryption of Discrete LogarithmsLecture Notes in Computer Science, 2003
- Paillier's cryptosystem revisitedPublished by Association for Computing Machinery (ACM) ,2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding ProtocolsPublished by Springer Science and Business Media LLC ,2001
- Verifiable Disclosure of Secrets and Applications (Abstract)Published by Springer Science and Business Media LLC ,2001
- Priced Oblivious Transfer: How to Sell Digital GoodsLecture Notes in Computer Science, 2001
- The Bit Security of Paillier’s Encryption Scheme and Its ApplicationsLecture Notes in Computer Science, 2001
- Efficient Proofs that a Committed Number Lies in an IntervalLecture Notes in Computer Science, 2000
- Proving in Zero-Knowledge that a Number is the Product of Two Safe PrimesLecture Notes in Computer Science, 1999
- Linear zero-knowledge---a note on efficient zero-knowledge proofs and argumentsPublished by Association for Computing Machinery (ACM) ,1997
- Committed Oblivious Transfer and Private Multi-Party ComputationLecture Notes in Computer Science, 1995