Sciweavers

119 search results - page 5 / 24
» Finite models for formal security proofs
Sort
View
ESORICS
2007
Springer
14 years 1 months ago
On the Privacy of Concealed Data Aggregation
A formal treatment to the privacy of concealed data aggregation (CDA) is given. While there exist a handful of constructions, rigorous security models and analyses for CDA are stil...
Aldar C.-F. Chan, Claude Castelluccia
CSFW
2006
IEEE
14 years 1 months ago
Computationally Sound Compositional Logic for Key Exchange Protocols
We develop a compositional method for proving cryptographically sound security properties of key exchange protocols, based on a symbolic logic that is interpreted over conventiona...
Anupam Datta, Ante Derek, John C. Mitchell, Bogdan...
IHI
2012
217views Healthcare» more  IHI 2012»
12 years 3 months ago
Declarative privacy policy: finite models and attribute-based encryption
Regulations and policies regarding Electronic Health Information (EHI) are increasingly complex. Federal and State policy makers have called for both education to increase stakeho...
Peifung E. Lam, John C. Mitchell, Andre Scedrov, S...
CSFW
2011
IEEE
12 years 7 months ago
Security for Key Management Interfaces
—We propose a much-needed formal definition of security for cryptographic key management APIs. The advantages of our definition are that it is general, intuitive, and applicabl...
Steve Kremer, Graham Steel, Bogdan Warinschi
CSFW
2012
IEEE
11 years 10 months ago
Generic Indifferentiability Proofs of Hash Designs
—In this paper, we propose a formal analysis of domain extenders for hash functions in the indifferentiability framework. We define a general model for domain extenders and prov...
Marion Daubignard, Pierre-Alain Fouque, Yassine La...