Sciweavers

570 search results - page 17 / 114
» Black-box constructions for secure computation
Sort
View
EUROCRYPT
2007
Springer
13 years 11 months ago
Round-Efficient Secure Computation in Point-to-Point Networks
Essentially all work studying the round complexity of secure computation assumes broadcast as an atomic primitive. Protocols constructed under this assumption tend to have very poo...
Jonathan Katz, Chiu-Yuen Koo
SP
2009
IEEE
155views Security Privacy» more  SP 2009»
14 years 2 months ago
A Logic of Secure Systems and its Application to Trusted Computing
We present a logic for reasoning about properties of secure systems. The logic is built around a concurrent programming language with constructs for modeling machines with shared ...
Anupam Datta, Jason Franklin, Deepak Garg, Dilsun ...
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
14 years 8 months ago
Universally composable two-party and multi-party secure computation
d Abstract) Ran Canetti Yehuda Lindell Rafail Ostrovsky Amit Sahai? We show how to securely realize any multi-party functionality in a universally composable way, regardless of th...
Ran Canetti, Yehuda Lindell, Rafail Ostrovsky, Ami...
BIRTHDAY
2010
Springer
13 years 9 months ago
Automated Proofs for Asymmetric Encryption
Chosen-ciphertext security is by now a standard security property for asymmetric encryption. Many generic constructions for building secure cryptosystems from primitives with lower...
Judicaël Courant, Marion Daubignard, Cristian...
ITCC
2005
IEEE
14 years 1 months ago
Semantic Grid - Interoperability Solution for Construction VO?
Construction activities take place in what can be called a dynamic virtual organization (VO). VOs require a secure, reliable, scalable information infrastructure that allows colla...
Ziga Turk, Matevz Dolenc, Vlado Stankovski, Etiel ...