Advertisement

Cryptographic Protocols Underlying Privacy-ABCs

  • Patrik Bichsel
  • Jan Camenisch
  • Maria Dubovitskaya
  • Robert R. Enderlein
  • Stephan Krenn
  • Anja Lehmann
  • Gregory Neven
  • Franz-Stefan Preiss
Chapter

Abstract

In this chapter we present the Cryptographic Engine which provides the cryptographic functionality used in the ABC Engine, such as issuance or presentation of credentials. We first describe the architecture of the Cryptographic Engine, explain the building blocks it uses, and explain how they are bound together. We then describe the cryptographic primitives that the library uses to instantiate those building blocks.

Keywords

Blind Signature Cryptographic Protocol Commitment Scheme Message Space Blind Signature Scheme 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [BP97]
    Niko Barić and Birgit Pfitzmann. Collision-Free Accumulators and Fail-Stop Signature Schemes Without Trees. In W. Fumy, editor, EUROCRYPT, volume 1233 of LNCS, pages 480–494. Springer, 1997.Google Scholar
  2. [Bra93]
    Stefan A Brands. An Efficient Off-line Electronic Cash System Based On The Representation Problem. Technical report, 1993.Google Scholar
  3. [CKY09]
    Jan Camenisch, Aggelos Kiayias, and Moti Yung. On the Portability of Generalized Schnorr Proofs. In A. Joux, editor, EUROCRYPT 09, volume 5479 of LNCS, pages 425–442. Springer, 2009.Google Scholar
  4. [CL02a]
    Jan Camenisch and Anna Lysyanskaya. A Signature Scheme with Efficient Protocols. In S. Cimato, C. Galdi, and G. Persiano, editors, SCN 02, volume 2576 of LNCS, pages 268–289. Springer, 2002.Google Scholar
  5. [CL02b]
    Jan Camenisch and Anna Lysyanskaya. Dynamic Accumulators and Application to Efficient Revocation of Anonymous Credentials. In M. Yung, editor, CRYPTO, volume 2442 of LNCS, pages 61–76. Springer, 2002.Google Scholar
  6. [CS97]
    Jan Camenisch and Markus Stadler. Efficient Group Signature Schemes for Large Groups (Extended Abstract). In B. S. Kaliski Jr., editor, CRYPTO, volume 1294 of LNCS, pages 410–424. Springer, 1997.Google Scholar
  7. [CS02]
    Ronald Cramer and Victor Shoup. Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption. In L. R. Knudsen, editor, EUROCRYPT, volume 2332 of LNCS, pages 45–64. Springer, 2002.Google Scholar
  8. [CS03]
    Jan Camenisch and Victor Shoup. Practical Verifiable Encryption and Decryption of Discrete Logarithms. In D. Boneh, editor, CRYPTO, volume 2729 of LNCS, pages 126–144. Springer, 2003.Google Scholar
  9. [DF02]
    Ivan Damgård and Eiichiro Fujisaki. A Statistically-Hiding Integer Commitment Scheme Based on Groups with Hidden Order. In Y. Zheng, editor, ASIACRYPT 02, volume 2501 of LNCS, pages 125–142. Springer, 2002.Google Scholar
  10. [FO97]
    Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations. In B. S. Kaliski Jr., editor, CRYPTO 97, volume 1294 of LNCS, pages 16–30. Springer, 1997.Google Scholar
  11. [FS87]
    Amos Fiat and Adi Shamir. How to Prove Yourself: Practical Solutions to Identification and Signature Problems. In A. M. Odlyzko, editor, CRYPTO 86, volume 263 of LNCS, pages 186–194. Springer, 1987.Google Scholar
  12. [Lip03]
    Helger Lipmaa. On Diophantine Complexity and Statistical Zero Knowledge Arguments. In C.-S. Laih, editor, ASIACRYPT 03, volume 2894 of LNCS, pages 398–415. Springer, 2003.Google Scholar
  13. [Pai99]
    Pascal Paillier. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes. In J. Stern, editor, EUROCRYPT, volume 1592 of LNCS, pages 223–238. Springer, 1999.Google Scholar
  14. [Ped91]
    Torben Pryds Pedersen. Non-Interactive and Information-Theoretic Secure Verifiable Secret Sharing. In J. Feigenbaum, editor, CRYPTO 91, volume 576 of LNCS, pages 129–140. Springer, 1991.Google Scholar
  15. [RS86]
    Michael O Rabin and Jeffery O Shallit. Randomized Algorithms in Number Theory. Communications in Pure and Applied Math, 39:239–256, 1986.Google Scholar
  16. [RSA78]
    Ronald L Rivest, Adi Shamir, and Len Adleman. A Method for Obtaining Digital Signatures and Public-Key Cryptosystems. Communications of the ACM, 21(2):120–126, 1978.Google Scholar
  17. [Sch91]
    Claus-Peter Schnorr. Efficient Signature Generation by Smart Cards. Journal of Cryptology, 4(3):161–174, 1991.Google Scholar
  18. [VLG+14]
    Fatbardh Veseli, Jesus Luna, Hamza Ghani, Tsvetoslava Vateva-Gurova, Harald Zwingelberg, Katalin Storf, Felix Bieker, Daniel Deibler, and Marit Hansen. Benchmarking Criteria. Deliverable D2.3, The ABC4Trust EU Project, 2014. Available at https://abc4trust.eu/download/D2.3%20-%20Benchmarking%20Criteria.pdf, Last accessed on 2014-11-08.

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  • Patrik Bichsel
    • 1
  • Jan Camenisch
    • 1
  • Maria Dubovitskaya
    • 1
  • Robert R. Enderlein
    • 1
  • Stephan Krenn
    • 1
  • Anja Lehmann
    • 1
  • Gregory Neven
    • 1
  • Franz-Stefan Preiss
    • 1
  1. 1.IBM ResearchZurichSwitzerland

Personalised recommendations