Sciweavers

102 search results - page 7 / 21
» Perfectly Secure Multiparty Computation and the Computationa...
Sort
View
STOC
2010
ACM
227views Algorithms» more  STOC 2010»
15 years 2 months ago
On the Round Complexity of Covert Computation
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
Vipul Goyal and Abhishek Jain
ASIACRYPT
2007
Springer
15 years 1 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á, ...
91
Voted
EUROCRYPT
2007
Springer
15 years 3 months ago
Atomic Secure Multi-party Multiplication with Low Communication
We consider the standard secure multi-party multiplication protocol due to M. Rabin. This protocol is based on Shamir’s secret sharing scheme and it can be viewed as a practical ...
Ronald Cramer, Ivan Damgård, Robbert de Haan
IJNSEC
2008
145views more  IJNSEC 2008»
14 years 9 months ago
Efficient Certificateless Authentication and Key Agreement (CL-AK) for Grid Computing
Most of the current security architectures for grid systems use conventional public key infrastructure (PKI) to authenticate grid members and to secure resource allocation to thes...
Shengbao Wang, Zhenfu Cao, Haiyong Bao
75
Voted
AINA
2009
IEEE
15 years 2 months ago
Identity-Based Cryptography for Securing Mobile Phone Calls
In this paper, an identity-based key agreement system for mobile telephony in GSM and UMTS networks is presented. The use of telephone numbers as public keys allows the system to ...
Matthew Smith, Christian Schridde, Björn Agel...