A signature scheme associated with universal re-signcryption

Kohei Tatara, Kouichi Sakurai

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

Today, with increasing deversity of network technologies, people have been likely to be insterested 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.

Original languageEnglish
Title of host publicationProceedings - International Conference on Availability, Reliability and Security, ARES 2009
Pages780-785
Number of pages6
DOIs
Publication statusPublished - Oct 12 2009
EventInternational Conference on Availability, Reliability and Security, ARES 2009 - Fukuoka, Fukuoka Prefecture, Japan
Duration: Mar 16 2009Mar 19 2009

Publication series

NameProceedings - International Conference on Availability, Reliability and Security, ARES 2009

Other

OtherInternational Conference on Availability, Reliability and Security, ARES 2009
CountryJapan
CityFukuoka, Fukuoka Prefecture
Period3/16/093/19/09

Fingerprint

Cryptography
Computational complexity
Semantics

All Science Journal Classification (ASJC) codes

  • Software
  • Safety, Risk, Reliability and Quality

Cite this

Tatara, K., & Sakurai, K. (2009). A signature scheme associated with universal re-signcryption. In Proceedings - International Conference on Availability, Reliability and Security, ARES 2009 (pp. 780-785). [5066564] (Proceedings - International Conference on Availability, Reliability and Security, ARES 2009). https://doi.org/10.1109/ARES.2009.104

A signature scheme associated with universal re-signcryption. / Tatara, Kohei; Sakurai, Kouichi.

Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. p. 780-785 5066564 (Proceedings - International Conference on Availability, Reliability and Security, ARES 2009).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Tatara, K & Sakurai, K 2009, A signature scheme associated with universal re-signcryption. in Proceedings - International Conference on Availability, Reliability and Security, ARES 2009., 5066564, Proceedings - International Conference on Availability, Reliability and Security, ARES 2009, pp. 780-785, International Conference on Availability, Reliability and Security, ARES 2009, Fukuoka, Fukuoka Prefecture, Japan, 3/16/09. https://doi.org/10.1109/ARES.2009.104
Tatara K, Sakurai K. A signature scheme associated with universal re-signcryption. In Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. p. 780-785. 5066564. (Proceedings - International Conference on Availability, Reliability and Security, ARES 2009). https://doi.org/10.1109/ARES.2009.104
Tatara, Kohei ; Sakurai, Kouichi. / A signature scheme associated with universal re-signcryption. Proceedings - International Conference on Availability, Reliability and Security, ARES 2009. 2009. pp. 780-785 (Proceedings - International Conference on Availability, Reliability and Security, ARES 2009).
@inproceedings{1cd2355e495d4743a6edaaa29e84a60e,
title = "A signature scheme associated with universal re-signcryption",
abstract = "Today, with increasing deversity of network technologies, people have been likely to be insterested 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.",
author = "Kohei Tatara and Kouichi Sakurai",
year = "2009",
month = "10",
day = "12",
doi = "10.1109/ARES.2009.104",
language = "English",
isbn = "9780769535647",
series = "Proceedings - International Conference on Availability, Reliability and Security, ARES 2009",
pages = "780--785",
booktitle = "Proceedings - International Conference on Availability, Reliability and Security, ARES 2009",

}

TY - GEN

T1 - A signature scheme associated with universal re-signcryption

AU - Tatara, Kohei

AU - Sakurai, Kouichi

PY - 2009/10/12

Y1 - 2009/10/12

N2 - Today, with increasing deversity of network technologies, people have been likely to be insterested 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.

AB - Today, with increasing deversity of network technologies, people have been likely to be insterested 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.

UR - http://www.scopus.com/inward/record.url?scp=70349660085&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=70349660085&partnerID=8YFLogxK

U2 - 10.1109/ARES.2009.104

DO - 10.1109/ARES.2009.104

M3 - Conference contribution

SN - 9780769535647

T3 - Proceedings - International Conference on Availability, Reliability and Security, ARES 2009

SP - 780

EP - 785

BT - Proceedings - International Conference on Availability, Reliability and Security, ARES 2009

ER -