Sciweavers

3504 search results - page 428 / 701
» Secure protocol composition
Sort
View
POPL
2005
ACM
16 years 2 months ago
Statically checking confidentiality via dynamic labels
This paper presents a new approach for verifying confidenfor programs, based on abstract interpretation. The framework is formally developed and proved correct in the theorem prov...
Bart Jacobs, Wolter Pieters, Martijn Warnier
116
Voted
SOSE
2006
IEEE
15 years 8 months ago
Service Engineering Design Patterns
Design of service-oriented applications differs from design of the component-based applications in granularity, abstraction and dynamic environment in which binding between client...
Nikola Milanovic
CRYPTO
2004
Springer
139views Cryptology» more  CRYPTO 2004»
15 years 8 months ago
How to Compress Rabin Ciphertexts and Signatures (and More)
Ordinarily, RSA and Rabin ciphertexts and signatures are log N bits, where N is a composite modulus; here, we describe how to “compress” Rabin ciphertexts and signatures (among...
Craig Gentry
137
Voted
CRYPTO
2010
Springer
157views Cryptology» more  CRYPTO 2010»
15 years 3 months ago
Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Ba
The main results of this work are new public-key encryption schemes that, under the quadratic residuosity (QR) assumption (or Paillier's decisional composite residuosity (DCR...
Zvika Brakerski, Shafi Goldwasser
112
Voted
IDTRUST
2009
ACM
15 years 9 months ago
Usable trust anchor management
Security in browsers is based upon users trusting a set of root Certificate Authorities (called Trust Anchors) which they may know little or nothing about. Browser vendors face a...
Massimiliano Pala, Scott A. Rea