Secure two-party computation in sublinear (amortized) time
Authors:
Open Access
- 16 October 2012
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 513-524
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- On the Security of the “Free-XOR” Technique2012
- VMCrypt2011
- Oblivious RAM with O((logN)3) Worst-Case Cost2011
- A Proof of Security of Yao’s Protocol for Two-Party ComputationJournal of Cryptology, 2008
- Improved Garbled Circuit: Free XOR Gates and Applications2008
- Private information storage (extended abstract)1997
- Software protection and simulation on oblivious RAMsJournal of the ACM, 1996
- Precomputing Oblivious Transfer1995
- How to play ANY mental game1987
- A randomized protocol for signing contractsCommunications of the ACM, 1985