83 search results - page 5 / 17 » Efficient Two-Party Secure Computation on Committed Inputs |
WWW
2005
ACM
14 years 8 months ago
2005
ACM
A fair contract signing protocol allows two potentially mistrusted parities to exchange their commitments (i.e., digital signatures) to an agreed contract over the Internet in a f...
CIS
2006
Springer
13 years 11 months ago
2006
Springer
For senior executives, information security is a basic requirement for business success. Yet, despite being well-motivated, top managers often have only a superficial understandin...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
On the one hand, compilers for secure computation protocols, such as FairPlay or FairPlayMP, have significantly simplified the development of such protocols. On the other hand, ...
ACNS
2007
Springer
13 years 11 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
ASIACRYPT
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We consider scenarios in which two parties, each in possession of a graph, wish to compute some algorithm on their joint graph in a privacy-preserving manner, that is, wi...