Two-Output Secure Computation with Malicious Adversaries
Authors:
- 1 January 2011
- book chapter
- Published by Springer Nature
- p. 386-405
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- An Efficient Protocol for Fair Secure Two-Party ComputationLecture Notes in Computer Science, 2008
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries2008
- Efficient Protocols for Set Membership and Range Proofs2008
- Improved Garbled Circuit: Free XOR Gates and Applications2008
- Short Signatures Without Random Oracles and the SDH Assumption in Bilinear GroupsJournal of Cryptology, 2007
- Efficient Two-Party Secure Computation on Committed Inputs2007
- An Efficient Protocol for Secure Two-Party Computation in the Presence of Malicious Adversaries2007
- Efficiency Tradeoffs for Malicious Two-Party Computation2006
- How To Construct Constant-Round Zero-Knowledge Proof Systems for NPJournal of Cryptology, 1996
- A randomized protocol for signing contractsCommunications of the ACM, 1985