Sciweavers

36 search results - page 5 / 8
» Security Against Covert Adversaries: Efficient Protocols for...
Sort
View
ASIACRYPT
2007
Springer
13 years 11 months ago
Simple and Efficient Perfectly-Secure Asynchronous MPC
Secure multi-party computation (MPC) allows a set of n players to securely compute an agreed function of their inputs, even when up to t players are under the control of an adversa...
Zuzana Beerliová-Trubíniová, ...
TCC
2009
Springer
255views Cryptology» more  TCC 2009»
14 years 8 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
IJNSEC
2008
120views more  IJNSEC 2008»
13 years 7 months ago
Formal Specification and Verification of a Secure Micropayment Protocol
As online businesses keep growing and Web services become pervasive, there is an increasing demand for micropayment protocols that facilitate microcommerce, namely selling content...
Mohamed G. Gouda, Alex X. Liu
CTRSA
2006
Springer
156views Cryptology» more  CTRSA 2006»
13 years 11 months ago
Universally Composable Oblivious Transfer in the Multi-party Setting
We construct efficient universally composable oblivious transfer protocols in the multi-party setting for honest majorities. Unlike previous proposals our protocols are designed in...
Marc Fischlin
EUROCRYPT
2000
Springer
13 years 11 months ago
Provably Secure Password-Authenticated Key Exchange Using Diffie-Hellman
Abstract. When designing password-authenticated key exchange protocols (as opposed to key exchange protocols authenticated using cryptographically secure keys), one must not allow ...
Victor Boyko, Philip D. MacKenzie, Sarvar Patel