Parallel key-insulated public key encryption without random oracles

Libert, Benoît;Quisquater, Jean-Jacques;Yung, M.
(2007) Public Key Cryptography-PKC 2007. 10th International Conference on Practice and Theory in Public-Key Cryptography. Proceedings — Location: Beijing, China (16.April.2007)

Files

No attached file found for this publication.

Details

Authors
Abstract
Key-insulated cryptography is a crucial technique for protecting private keys. To strengthen the security of key-insulated protocols, Hanaoka, Hanaoka and Imai recently introduced the idea of parallel key-insulated encryption (PKIE) where distinct physically-secure devices (called helpers) are independently used in key updates. Their motivation was to reduce the risk of exposure for helpers by decreasing the frequency of their connections to insecure environments. Hanaoka et al. showed that it was non-trivial to achieve a PKIE scheme fitting their model and proposed a construction based on the Boneh-Franklin identity-based encryption (IBE) scheme. The security of their system was only analyzed in the idealized random oracle model. In this paper, we provide a fairly efficient scheme which is secure in the standard model (i.e. without random oracles). To do so, we first show the existence of a relation between PKIE and the notion of aggregate signatures (AS) suggested by Boneh et al. We then describe our random oracle-free construction using bilinear maps. Thus, our contributions are both on the concrete side, namely the first realization of parallel key-insulated encryption without the random oracle idealization, and on the conceptual side revealing the relationships between two seemingly unrelated primitives.
Affiliations

Citations

  • APA
  • Chicago
  • FWB

Libert, B., Quisquater, J.-J., & Yung, M. (2007). Parallel key-insulated public key encryption without random oracles. In Okamoto, T.; Wang, X.; (ed.), Public Key Cryptography-PKC 2007. 10th International Conference onPractice and Theory in Public-Key Cryptography. Proceedings (LectureNotes in Computer Science Vol.4450) (p. p. 298-314). Springer. https://hdl.handle.net/2078.5/230387