Efficient Two-Party Secure Computation on Committed Inputs
Authors:
- 1 January 2007
- book chapter
- Published by Springer Nature
- p. 97-114
Abstract
No abstract availableKeywords
This publication has 27 references indexed in Scilit:
- Practical Verifiable Encryption and Decryption of Discrete Logarithms2003
- Paillier's cryptosystem revisited2001
- Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols2001
- Verifiable Disclosure of Secrets and Applications (Abstract)2001
- Priced Oblivious Transfer: How to Sell Digital Goods2001
- The Bit Security of Paillier’s Encryption Scheme and Its Applications2001
- Efficient Proofs that a Committed Number Lies in an Interval2000
- Proving in Zero-Knowledge that a Number is the Product of Two Safe Primes1999
- Linear zero-knowledge---a note on efficient zero-knowledge proofs and arguments1997
- Committed Oblivious Transfer and Private Multi-Party Computation1995