Security of verifiably encrypted signatures and a construction without random oracles

Authored book
(Volume of book series)


Publication Details

Author(s): Rückert M, Schröder D
Publication year: 2009
Title of series: Pairing-Based Cryptography - Pairing 2009
Pages range: 17-34
ISBN: 9783642032974


Abstract


In a verifiably encrypted signature scheme, signers encrypt their signature under the public key of a trusted third party and prove that they did so correctly. The security properties, due to Boneh et al. (Eurocrypt 2003), are unforgeability and opacity. This paper proposes two novel fundamental requirements for verifiably encrypted signatures, called extractability and abuse-freeness, and analyzes its effects on the established security model. Extractability ensures that the trusted third party is always able to extract a valid signature from a valid verifiably encrypted signature and abuse-freeness guarantees that a malicious signer, who cooperates with the trusted party, is not able to forge a verifiably encrypted signature. We further show that both properties are not covered by the model of Boneh et al. The second main contribution of this paper is a verifiably encrypted signature scheme, provably secure without random oracles, that is more efficient and greatly improves the public key size of the only other construction in the standard model by Lu et al. (Eurocrypt 2006). Moreover, we present strengthened definitions for unforgeability and opacity in the spirit of strong unforgeability of digital signature schemes. © 2009 Springer Berlin Heidelberg.



FAU Authors / FAU Editors

Schröder, Dominique Prof. Dr.
Lehrstuhl für Informatik 13 (Angewandte Kryptographie)


How to cite

APA:
Rückert, M., & Schröder, D. (2009). Security of verifiably encrypted signatures and a construction without random oracles.

MLA:
Rückert, Markus, and Dominique Schröder. Security of verifiably encrypted signatures and a construction without random oracles. 2009.

BibTeX: 

Last updated on 2018-06-08 at 17:23