Multi-recipient Public-Key Encryption from Simulators in Security Proofs

  • Authors:
  • Harunaga Hiwatari;Keisuke Tanaka;Tomoyuki Asano;Koichi Sakumoto

  • Affiliations:
  • Sony Corporation, Tokyo, Japan 108-0075;Dept. of Mathematical and Computing Sciences, Tokyo Institute of Technology, Tokyo, Japan 152-8552;Sony Corporation, Tokyo, Japan 108-0075;Sony Corporation, Tokyo, Japan 108-0075

  • Venue:
  • ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

In PKC 2003, Bellare, Boldyreva, and Staddon proposed the reproducibility test. The test determines whether a single-recipient public-key encryption scheme is adapted to transform into an efficient multi-recipient public-key encryption scheme. In this paper, we propose a new approach to design an efficient multi-recipient single-message public-key encryption scheme. We focus on a certain simulator which appears in the security proof of an ordinary (single-recipient) public-key encryption scheme. By considering the behavior of the simulator, we construct two efficient multi-recipient single-message public-key encryption schemes. These schemes show that there exist schemes which can be transformed into efficient multi-recipient schemes, even they do not pass the reproducibility test.