Sciweavers

469 search results - page 56 / 94
» On Adversary Models and Compositional Security
Sort
View
CONCUR
1998
Springer
13 years 12 months ago
Alternating Refinement Relations
Alternating transition systems are a general model for composite systems which allow the study of collaborative as well as adversarial relationships between individual system compo...
Rajeev Alur, Thomas A. Henzinger, Orna Kupferman, ...
EUROCRYPT
2007
Springer
14 years 1 months ago
Secure Computation from Random Error Correcting Codes
Abstract. Secure computation consists of protocols for secure arithmetic: secret values are added and multiplied securely by networked processors. The striking feature of secure co...
Hao Chen, Ronald Cramer, Shafi Goldwasser, Robbert...
TCC
2010
Springer
381views Cryptology» more  TCC 2010»
14 years 4 months ago
New Techniques for Dual System Encryption and Fully Secure HIBE with Short Ciphertexts
We construct a fully secure HIBE scheme with short ciphertexts. The previous construction of Boneh, Boyen, and Goh was only proven to be secure in the selective model, under a non...
Allison B. Lewko, Brent Waters
AOSD
2010
ACM
14 years 1 months ago
A permission system for secure AOP
The integration of third-party aspects into applications creates security challenges. Due to the intrusive impact of aspects, one cannot guarantee that the dynamic composition of ...
Wouter De Borger, Bart De Win, Bert Lagaisse, Wout...
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
13 years 11 months ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...