Sciweavers

2372 search results - page 254 / 475
» is 2012
Sort
View
CSFW
2012
IEEE
12 years 1 months ago
Securing Interactive Programs
Abstract—This paper studies the foundations of informationflow security for interactive programs. Previous research assumes that the environment is total, that is, it must alway...
Willard Rafnsson, Daniel Hedin, Andrei Sabelfeld
CSFW
2012
IEEE
12 years 1 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...
CSFW
2012
IEEE
12 years 1 months ago
Verifying Privacy-Type Properties in a Modular Way
—Formal methods have proved their usefulness for analysing the security of protocols. In this setting, privacy-type security properties (e.g. vote-privacy, anonymity, unlinkabili...
Myrto Arapinis, Vincent Cheval, Stéphanie D...
CSFW
2012
IEEE
12 years 1 months ago
Discovering Concrete Attacks on Website Authorization by Formal Analysis
—Social sign-on and social sharing are becoming an ever more popular feature of web applications. This success is largely due to the APIs and support offered by prominent social ...
Chetan Bansal, Karthikeyan Bhargavan, Sergio Maffe...
CRYPTO
2012
Springer
254views Cryptology» more  CRYPTO 2012»
12 years 1 months ago
Breaking and Repairing GCM Security Proofs
Abstract. In this paper, we study the security proofs of GCM (Galois/Counter Mode of Operation). We first point out that a lemma, which is related to the upper bound on the probab...
Tetsu Iwata, Keisuke Ohashi, Kazuhiko Minematsu