159
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
In collusion-free protocols, subliminal communication is impossible and parties are thus unable to communicate “any information beyond what the protocol allows”. Collusion-fre...
198
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We construct a functional encryption scheme secure against an a-priori bounded polynomial number of collusions for the class of all polynomial-size circuits. Our constructions req...
230
click to vote
CRYPTO
2012
Springer
13 years 9 months ago
2012
Springer
We provide a functional encryption system that supports functionality for regular languages. In our system a secret key is associated with a Deterministic Finite Automata (DFA) M....
212
click to vote
CRYPTO
2012
Springer
13 years 9 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 ...
190
click to vote
CRYPTO
2012
Springer
13 years 9 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...
230
click to vote
CSFW
2012
IEEE
13 years 9 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 ...
210
click to vote
CSFW
2012
IEEE
13 years 9 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...
216
click to vote
CSFW
2012
IEEE
13 years 9 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...
209
click to vote
CSFW
2012
IEEE
13 years 9 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...