Forward-Secure Distributed Encryption

  • Wouter Lueks
  • Jaap-Henk Hoepman
  • Klaus Kursawe
Part of the Lecture Notes in Computer Science book series (LNCS, volume 8555)


Distributed encryption is a cryptographic primitive that implements revocable privacy. The primitive allows a recipient of a message to decrypt it only if enough senders encrypted that same message. We present a new distributed encryption scheme that is simpler than the previous solution by Hoepman and Galindo–in particular it does not rely on pairings–and that satisfies stronger security requirements. Moreover, we show how to achieve key evolution, which is necessary to ensure scalability in many practical applications, and prove that the resulting scheme is forward secure. Finally, we present a provably secure batched distributed encryption scheme that is much more efficient for small plaintext domains, but that requires more storage


Hash Function Secret Share Random Oracle Secret Sharing Scheme Random Oracle Model 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bernstein, D.J., Hamburg, M., Krasnova, A., Lange, T.: Elligator: elliptic-curve points indistinguishable from uniform random strings. In: Sadeghi, A.R., Gligor, V.D., Yung, M. (eds.) ACM Conference on Computer and Communications Security, pp. 967–980. ACM (2013)Google Scholar
  2. 2.
    Camenisch, J., Hohenberger, S., Kohlweiss, M., Lysyanskaya, A., Meyerovich, M.: How to win the clonewars: efficient periodic n-times anonymous authentication. In: Juels, A., Wright, R.N., De Capitani di Vimercati, S. (eds.) ACM Conference on Computer and Communications Security, pp. 201–210. ACM (2006)Google Scholar
  3. 3.
    Canetti, R., Halevi, S., Katz, J.: A forward-secure public-key encryption scheme. J. Cryptology 20(3), 265–294 (2007)CrossRefzbMATHMathSciNetGoogle Scholar
  4. 4.
    Cramer, R., Damgård, I., Ishai, Y.: Share conversion, pseudorandom secret-sharing and applications to secure computation. In: Kilian, J. (ed.) TCC 2005. LNCS, vol. 3378, pp. 342–362. Springer, Heidelberg (2005)CrossRefGoogle Scholar
  5. 5.
    Franklin, M.K.: A survey of key evolving cryptosystems. International Journal of Security and Networks 1(1/2), 46–53 (2006)CrossRefGoogle Scholar
  6. 6.
    Hoepman, J.H.: Revocable privacy. ENISA Quarterly Review 5(2) (June 2009)Google Scholar
  7. 7.
    Hoepman, J.H., Galindo, D.: Non-interactive distributed encryption: a new primitive for revocable privacy. In: Chen, Y., Vaidya, J. (eds.) Proceedings of the 10th Annual ACM Workshop on Privacy in the Electronic Society, WPES 2011, Chicago, IL, USA, October 17, pp. 81–92. ACM (2011)Google Scholar
  8. 8.
    Itkis, G.: Forward security – adaptive cryptography: Time evolution. In: Bidgoli, H. (ed.) Handbook of Information Security, pp. 927–944. John Wiley and Sons (2006)Google Scholar
  9. 9.
    Lueks, W., Everts, M.H., Hoepman, J.H.: Revocable privacy 2012 – use cases. Tech. Rep. 35627, TNO (2012)Google Scholar
  10. 10.
    Naor, M., Reingold, O.: Number-theoretic constructions of efficient pseudo-random functions. J. ACM 51(2), 231–262 (2004)CrossRefzbMATHMathSciNetGoogle Scholar
  11. 11.
    Ohkubo, M., Suzuki, K., Kinoshita, S.: Efficient Hash-Chain Based RFID Privacy Protection Scheme. In: International Conference on Ubiquitous Computing – Ubicomp, Workshop Privacy: Current Status and Future Directions, Nottingham, England (September 2004)Google Scholar
  12. 12.
    Shamir, A.: How to share a secret. Commun. ACM 22(11), 612–613 (1979)CrossRefzbMATHMathSciNetGoogle Scholar
  13. 13.
    Speed Check Services: SPECS3 network average speed check solutions, (accessed: January 27, 2013)
  14. 14.
    Stadler, M.: Cryptographic Protocols for Revocable Privacy. Ph.D. thesis, Swiss Federal Institute of Technology, Zürich (1996)Google Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Wouter Lueks
    • 1
  • Jaap-Henk Hoepman
    • 1
  • Klaus Kursawe
    • 2
  1. 1.Radboud University NijmegenNijmegenThe Netherlands
  2. 2.The European Network for Cyber SecurityThe HagueThe Netherlands

Personalised recommendations