Sciweavers

686 search results - page 2 / 138
» Secure Two-Party Computation Is Practical
Sort
View
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
16 years 3 months ago
LEGO for Two-Party Secure Computation
The first and still most popular solution for secure two-party computation relies on Yao's garbled circuits. Unfortunately, Yao's construction provide security only again...
Jesper Buus Nielsen, Claudio Orlandi
EUROCRYPT
2008
Springer
15 years 4 months ago
Efficient Two Party and Multi Party Computation Against Covert Adversaries
Recently, Aumann and Lindell introduced a new realistic security model for secure computation, namely, security against covert adversaries. The main motivation was to obtain secure...
Vipul Goyal, Payman Mohassel, Adam Smith
NDSS
2003
IEEE
15 years 8 months ago
Proactive Two-Party Signatures for User Authentication
We study proactive two-party signature schemes in the context of user authentication. A proactive two-party signature scheme (P2SS) allows two parties—the client and the serverâ...
Antonio Nicolosi, Maxwell N. Krohn, Yevgeniy Dodis...
WISA
2010
Springer
15 years 23 days ago
A Two-Party Protocol with Trusted Initializer for Computing the Inner Product
Rafael Dowsley, Jeroen van de Graaf, Davidson Marq...
135
Voted
CTRSA
2008
Springer
197views Cryptology» more  CTRSA 2008»
15 years 4 months ago
Legally-Enforceable Fairness in Secure Two-Party Computation
In the setting of secure multiparty computation, a set of mutually distrustful parties wish to securely compute some joint function of their private inputs. The computation should...
Andrew Y. Lindell