163
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
We give the first proof of security for an identity-based encryption scheme in the quantum random oracle model. This is the first proof of security for any scheme in this model ...
145
click to vote
CRYPTO
2012
Springer
13 years 7 months ago
2012
Springer
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...
184
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—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 ...
159
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—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...
168
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—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...
152
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
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...
160
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—We show that Kripke semantics of modal logic, manifest in the syntactic proof formalism of labeled sequent calculi, can be used to solve three central problems in access control...
171
Voted
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
—We present a secure (fully abstract) compilation scheme to compile an object-based high-level language to lowchine code. Full abstraction is achieved by relying on a fine-grain...
136
click to vote
CSFW
2012
IEEE
13 years 7 months ago
2012
IEEE
Abstract—This paper introduces g-leakage, a rich generalization of the min-entropy model of quantitative information flow. In g-leakage, the benefit that an adversary derives f...