Sciweavers

8644 search results - page 179 / 1729
» On the Composition of Secure Systems
Sort
View
SP
1996
IEEE
140views Security Privacy» more  SP 1996»
15 years 10 months ago
A Security Model of Dynamic Labeling Providing a Tiered Approach to Verification
In the proposed mandatory access control model, arbitrary label changing policies can be expressed. The relatively simple model can capture a wide variety of security policies, in...
Simon N. Foley, Li Gong, Xiaolei Qian
FOCS
2003
IEEE
15 years 12 months ago
Bounded-Concurrent Secure Two-Party Computation in a Constant Number of Rounds
We consider the problem of constructing a general protocol for secure two-party computation in a way that preserves security under concurrent composition. In our treatment, we foc...
Rafael Pass, Alon Rosen
PAIRING
2010
Springer
116views Cryptology» more  PAIRING 2010»
15 years 5 months ago
Fully Secure Anonymous HIBE and Secret-Key Anonymous IBE with Short Ciphertexts
Lewko and Waters [Eurocrypt 2010] presented a fully secure HIBE with short ciphertexts. In this paper we show how to modify their construction to achieve anonymity. We prove the s...
Angelo De Caro, Vincenzo Iovino, Giuseppe Persiano
SIGSOFT
2003
ACM
16 years 7 months ago
Policy-enforced linking of untrusted components
d Abstract) Eunyoung Lee Andrew W. Appel Department of Computer Science Princeton University {elee,appel}@cs.princeton.edu Categories and Subject Descriptors D.2.4 [Software Engine...
Eunyoung Lee, Andrew W. Appel
STOC
2002
ACM
152views Algorithms» more  STOC 2002»
16 years 7 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...