A Signature Scheme Associated with Universal Re-signcryption

Today, with increasing deversity of network technologies, people have been likely to be interested in anonymity. The attacker might threaten anonymity of senders and receivers by confirming linkability between their sessions. Recently, Golle et al. proposed the re-encryption scheme applicable to Mix...

Full description

Saved in:
Bibliographic Details
Published in2009 International Conference on Availability, Reliability, and Security pp. 780 - 785
Main Authors Tatara, K., Sakurai, K.
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.03.2009
Subjects
Anonymity
Availability
Computational complexity
Computational efficiency
Digital Signature
Digital signatures
Information science
Information security
Public key
Public key cryptography
Relays
Signcryption
Universal Re-encryption
Unlinkability
Online AccessGet full text

Cover

More Information
Summary:Today, with increasing deversity of network technologies, people have been likely to be interested in anonymity. The attacker might threaten anonymity of senders and receivers by confirming linkability between their sessions. Recently, Golle et al. proposed the re-encryption scheme applicable to Mix, called universal re-encryption. In this scheme, a ciphertext is supposed to be re-encrypted without public information corresponding to it. Moreover, only a subject that re-enctypts a ciphertext can know the correspondence of original ciphertext and it, and the computational complexity to break the unlinkability property is equal to the semantic secrecy. In this paper, we consider and improve the universal re-encryption scheme, and propose a scheme that can verify who transmit the message by adding the property of signature.
ISBN:1424435722
9781424435722
DOI:10.1109/ARES.2009.104