Sciweavers

46 search results - page 5 / 10
» Stale-safe security properties for group-based secure inform...
Sort
View
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...
SKG
2006
IEEE
14 years 1 months ago
Security Attack Ontology for Web Services
Web services (WS) have become a significant part of the Web because of such attractive features as simple to use, platform independence, and XML/SOAP support. However, these featu...
Artem Vorobiev, Jun Han
NSPW
2004
ACM
14 years 29 days ago
Support for multi-level security policies in DRM architectures
Digital rights management systems allow copyrighted content to be commercialized in digital format without the risk of revenue loss due to piracy. Making such systems secure is no...
Bogdan C. Popescu, Bruno Crispo, Andrew S. Tanenba...
CCS
2009
ACM
14 years 2 months ago
A security-preserving compiler for distributed programs: from information-flow policies to cryptographic mechanisms
We enforce information flow policies in programs that run at multiple locations, with diverse levels of security. We build a compiler from a small imperative language with locali...
Cédric Fournet, Gurvan Le Guernic, Tamara R...
CRYPTO
2007
Springer
145views Cryptology» more  CRYPTO 2007»
13 years 11 months ago
Secure Identification and QKD in the Bounded-Quantum-Storage Model
We consider the problem of secure identification: user U proves to server S that he knows an agreed (possibly low-entropy) password w, while giving away as little information on w ...
Ivan Damgård, Serge Fehr, Louis Salvail, Chr...