Sciweavers

5488 search results - page 293 / 1098
» On the Secure Implementation of Security Protocols
Sort
View
STOC
2006
ACM
120views Algorithms» more  STOC 2006»
16 years 7 months ago
Black-box constructions for secure computation
d abstract) Yuval Ishai Eyal Kushilevitz Yehuda Lindell Erez Petrank It is well known that the secure computation of non-trivial functionalities in the setting of no honest majori...
Yuval Ishai, Eyal Kushilevitz, Yehuda Lindell, Ere...
TCC
2007
Springer
170views Cryptology» more  TCC 2007»
16 years 23 days ago
Secure Linear Algebra Using Linearly Recurrent Sequences
In this work we present secure two-party protocols for various core problems in linear algebra. Our main result is a protocol to obliviously decide singularity of an encrypted matr...
Eike Kiltz, Payman Mohassel, Enav Weinreb, Matthew...
CRYPTO
1987
Springer
87views Cryptology» more  CRYPTO 1987»
15 years 10 months ago
How to Make Replicated Data Secure
Many distributed systems manage some form of long-lived data, such as files or data bases. The performance and fault-tolerance of such systems may be enhanced if the repositories ...
Maurice Herlihy, J. D. Tygar
IJNSEC
2008
145views more  IJNSEC 2008»
15 years 6 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
CRYPTO
2006
Springer
106views Cryptology» more  CRYPTO 2006»
15 years 10 months ago
On Robust Combiners for Private Information Retrieval and Other Primitives
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
Remo Meier, Bartosz Przydatek