Sciweavers

252 search results - page 37 / 51
» How Secure is Deterministic Encryption
Sort
View
ICPP
2002
IEEE
14 years 17 days ago
Integrating Trust into Grid Resource Management Systems
Grid computing systems that have been the focus of much research activities in recent years provide a virtual framework for controlled sharing of resources across institutional bo...
Farag Azzedin, Muthucumaru Maheswaran
PQCRYPTO
2010
250views Cryptology» more  PQCRYPTO 2010»
13 years 11 months ago
Strongly Unforgeable Signatures and Hierarchical Identity-Based Signatures from Lattices without Random Oracles
Abstract. We propose a variant of the “bonsai tree” signature scheme, a latticebased existentially unforgeable signature scheme in the standard model. Our construction offers ...
Markus Rückert
CRYPTO
2004
Springer
120views Cryptology» more  CRYPTO 2004»
14 years 1 months ago
Round-Optimal Secure Two-Party Computation
Abstract. We consider the central cryptographic task of secure twoparty computation, where two parties wish to compute some function of their private inputs (each receiving possibl...
Jonathan Katz, Rafail Ostrovsky
SIAMCOMP
2011
13 years 2 months ago
Black-Box Constructions of Protocols for Secure Computation
In this paper, we study the question of whether or not it is possible to construct protocols for general secure computation in the setting of malicious adversaries and no honest m...
Iftach Haitner, Yuval Ishai, Eyal Kushilevitz, Yeh...
CHI
2009
ACM
14 years 8 months ago
Waterhouse: enabling secure e-mail with social networking
We present Waterhouse, a system for sending and receiving cryptographically protected electronic mail ("secure e-mail"). We show how an existing e-mail interface can be ...
Alex P. Lambert, Stephen M. Bezek, Karrie Karahali...