Sciweavers

PROVSEC
2007
Springer
13 years 10 months ago
On the Notions of PRP - RKA , KR and KR - RKA for Block Ciphers
Security of a modern block cipher is commonly measured in terms of its resistance to known attacks. While the provable security approach to block ciphers dates back to the first C...
Ermaliza Razali, Raphael C.-W. Phan, Marc Joye
PROVSEC
2007
Springer
13 years 10 months ago
Practical Threshold Signatures Without Random Oracles
We propose a secure threshold signature scheme without trusted dealer. Our construction is based on the recently proposed signature scheme of Waters in EUROCRYPT’05. The new thre...
Jin Li, Tsz Hon Yuen, Kwangjo Kim
PROVSEC
2007
Springer
13 years 10 months ago
Stronger Security of Authenticated Key Exchange
In this paper we study security definitions for authenticated key exchange (AKE) protocols. We observe that there are several families of attacks on AKE protocols that lie outsid...
Brian A. LaMacchia, Kristin Lauter, Anton Mityagin
PROVSEC
2007
Springer
13 years 10 months ago
Decryptable Searchable Encryption
As such, public-key encryption with keyword search (a.k.a PEKS or searchable encryption) does not allow the recipient to decrypt keywords i.e. encryption is not invertible. This pa...
Thomas Fuhr, Pascal Paillier
PROVSEC
2007
Springer
13 years 10 months ago
CCA2-Secure Threshold Broadcast Encryption with Shorter Ciphertexts
In a threshold broadcast encryption scheme, a sender chooses (ad-hoc) a set of n receivers and a threshold t, and then encrypts a message by using the public keys of all the recei...
Vanesa Daza, Javier Herranz, Paz Morillo, Carla R&...
PROVSEC
2007
Springer
13 years 10 months ago
Complex Zero-Knowledge Proofs of Knowledge Are Easy to Use
Sébastien Canard, Iwen Coisel, Jacques Trao...
PROVSEC
2007
Springer
13 years 10 months ago
Does Secure Time-Stamping Imply Collision-Free Hash Functions?
Ahto Buldas, Aivo Jürgenson
PROVSEC
2007
Springer
13 years 10 months ago
Formal Proof of Provable Security by Game-Playing in a Proof Assistant
Game-playing is an approach to write security proofs that are easy to verify. In this approach, security definitions and intractable problems are written as programs called games ...
Reynald Affeldt, Miki Tanaka, Nicolas Marti