Paper 2016/873

Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions

Rongmao Chen, Yi Mu, Guomin Yang, Willy Susilo, Fuchun Guo, and Mingwu Zhang

Abstract

Motivated by the revelations of Edward Snowden, post-Snowden cryptography has become a prominent research direction in recent years. In Eurocrypt 2015, Mironov and Stephens-Davidowitz proposed a novel concept named cryptographic reverse firewall (CRF) which can resist exfiltration of secret information from an arbitrarily compromised machine. In this work, we continue this line of research and present generic CRF constructions for several widely used cryptographic protocols based on a new notion named malleable smooth projective hash function. Our contributions can be summarized as follows. We introduce the notion of malleable smooth projective hash function, which is an extension of the smooth projective hash function (SPHF) introduced by Cramer and Shoup (Eurocrypt'02) with the new properties of key malleability and element rerandomizability. We demonstrate the feasibility of our new notion using graded rings proposed by Benhamouda et al. (Crypto'13), and present an instantiation from the k-linear assumption. Moreover, we show that the malleable SPHF can also be based on other standard assumptions. We show how to generically construct CRFs via malleable SPHFs in a modular way for some widely used cryptographic protocols. Specifically, we propose generic constructions of CRFs for the unkeyed message-transmission protocol and the oblivious signature-based envelope (OSBE) protocol of Blazy, Pointcheval and Vergnaud (TCC'12). We also present a new malleable SPHFfrom the linear encryption of valid signatures for instantiating the OSBE protocol with CRFs. We further study the two-pass oblivious transfer (OT) protocol and show that the malleable SPHF does not suffice for its CRF constructions. We then develop a new OT framework from graded rings and show how to construct OT-CRFs by modifying the malleable SPHF framework. This new framework encompasses the DDH-based OT-CRF constructions proposed by Mironov and Stephens-Davidowitz (Eurocrypt'15), and yields a new construction under the $k$-linear assumption.

Metadata
Available format(s)
PDF
Publication info
Published by the IACR in ASIACRYPT 2016
Keywords
Cryptographic reverse firewallmalleable smooth projective hash functionoblivious signature-based envelopeoblivious transfer
Contact author(s)
rc517 @ uowmail edu au
History
2016-09-11: received
Short URL
https://ia.cr/2016/873
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2016/873,
      author = {Rongmao Chen and Yi Mu and Guomin Yang and Willy Susilo and Fuchun Guo and Mingwu Zhang},
      title = {Cryptographic Reverse Firewall via Malleable Smooth Projective Hash Functions},
      howpublished = {Cryptology ePrint Archive, Paper 2016/873},
      year = {2016},
      note = {\url{https://eprint.iacr.org/2016/873}},
      url = {https://eprint.iacr.org/2016/873}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.