Sciweavers

5484 search results - page 40 / 1097
» Almost-Everywhere Secure Computation
Sort
View
CRYPTO
2006
Springer
232views Cryptology» more  CRYPTO 2006»
15 years 3 months ago
Algebraic Geometric Secret Sharing Schemes and Secure Multi-Party Computations over Small Fields
Abstract. We introduce algebraic geometric techniques in secret sharing and in secure multi-party computation (MPC) in particular. The main result is a linear secret sharing scheme...
Hao Chen, Ronald Cramer
P2P
2005
IEEE
106views Communications» more  P2P 2005»
15 years 5 months ago
Trusted Computing: Providing Security for Peer-to-Peer Networks
In this paper, we demonstrate the application of Trusted Computing to securing Peer-to-Peer (P2P) networks. We identify a central challenge in providing many of the security servi...
Shane Balfe, Amit D. Lakhani, Kenneth G. Paterson
ISW
2004
Springer
15 years 5 months ago
Universally Composable Secure Mobile Agent Computation
We study the security challenges faced by the mobile agent paradigm, where code travels and performs computations on remote hosts in an autonomous manner. We define universally co...
Ke Xu, Stephen R. Tate
PAIRING
2010
Springer
153views Cryptology» more  PAIRING 2010»
14 years 10 months ago
Compact Hardware for Computing the Tate Pairing over 128-Bit-Security Supersingular Curves
This paper presents a novel method for designing compact yet efficient hardware implementations of the Tate pairing over supersingular curves in small characteristic. Since such cu...
Nicolas Estibals
FC
2007
Springer
104views Cryptology» more  FC 2007»
15 years 6 months ago
A Sense of Security in Pervasive Computing - Is the Light on When the Refrigerator Door Is Closed?
In this paper, we investigate how existing theoretical contributions on usable security can serve to guide the design of a specific system. We illustrate how going through this the...
Jakob Illeborg Pagter, Marianne Graves Petersen