On the joint security of signature and encryption schemes under randomness reuse: Efficiency and security amplification

• Type: Article in International Conference Proceedings Book
• Date: 2012

Authors

Arriaga, A (Author) Other; Barbosa, M (Author) Other; Farshim, P (Author) Other

Conference proceedings International

Title: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Pages: 206-223

10th International Conference on Applied Cryptography and Network Security, ACNS 2012

Singapore, 26 June 2012 through 29 June 2012

Indexing

Scopus - 6 Citations

Other information

Authenticus ID: P-008-4P2

DOI: 10.1007/978-3-642-31284-7_13

Abstract (EN): We extend the work of Bellare, Boldyreva and Staddon on the systematic analysis of randomness reuse to construct multi-recipient encryption schemes to the case where randomness is reused across different cryptographic primitives. We find that through the additional binding introduced through randomness reuse, one can actually obtain a security amplification with respect to the standard black-box compositions, and achieve a stronger level of security. We introduce stronger notions of security for encryption and signatures, where challenge messages can depend in a restricted way on the random coins used in encryption, and show that two variants of the KEM/DEM paradigm give rise to encryption schemes that meet this enhanced notion of security. We obtain the most efficient signcryption scheme to date that is secure against insider attackers without random oracles. © 2012 Springer-Verlag.

Language: English

Type (Professor's evaluation): Scientific