skip to main content
10.1145/2046707.2046749acmconferencesArticle/Chapter ViewAbstractPublication PagesccsConference Proceedingsconference-collections
keynote

Cryptographic primitives for building secure and privacy respecting protocols

Published: 17 October 2011 Publication History

Abstract

Using the Internet and other electronic media for our daily tasks has become common. Thereby a lot of sensitive information is exchanged, processed, and stored at many different laces. Once released, controlling the dispersal of this information is virtually impossible. Worse, the press reports daily on incidents where sensitive information has been lost, stolen, or misused - often involving large and reputable organizations. Privacy-enhancing technologies can help to minimize the amount of information that needs to be revealed in transactions, on the one hand, and to limit the dispersal, on the other hand. Many of these technologies build on common cryptographic primitives that allow for data to be authenticated and encrypted in such a way that it is possible to efficiently prove possession and/or properties of data revealing the data or side-information about it. Proving such statements is of course possible for any signature and encryption scheme. However, if the result is to be practical, special cryptographic primitives and proof protocols are needed.
In this talk we will first consider a few example scenarios and motivate the need for such cryptograph building block before we then present and discuss these. We start with efficient discrete logarithms based proof protocols often referred to as generalized Schnorr proofs. They allow one to prove knowledge of different discrete logarithms (exponents) and relations among them. Now, to be able to prove possession of a (valid) signature and a message with generalized Schnorr proofs, it is necessary that the signature and the message signed are exponents and that no hash-function is used in the signature verification. Similarly, for encryption schemes, the plain text needs to be an exponent. We will present and discuss a number of such signature and encryption schemes.
To show the power of these building blocks, we will consider a couple of example protocols such as anonymous access control and anonymous polling. We then conclude with a discussion on security definition and proofs. We hope that the presented building blocks will enable many new privacy-preserving protocols and and applications in the future.

Cited By

View all
  • (2015)Protection Goals for Privacy EngineeringProceedings of the 2015 IEEE Security and Privacy Workshops10.1109/SPW.2015.13(159-166)Online publication date: 21-May-2015

Index Terms

  1. Cryptographic primitives for building secure and privacy respecting protocols

          Recommendations

          Comments

          Information & Contributors

          Information

          Published In

          cover image ACM Conferences
          CCS '11: Proceedings of the 18th ACM conference on Computer and communications security
          October 2011
          742 pages
          ISBN:9781450309486
          DOI:10.1145/2046707

          Sponsors

          Publisher

          Association for Computing Machinery

          New York, NY, United States

          Publication History

          Published: 17 October 2011

          Permissions

          Request permissions for this article.

          Check for updates

          Author Tags

          1. cryptographic protocols
          2. privacy

          Qualifiers

          • Keynote

          Conference

          CCS'11
          Sponsor:

          Acceptance Rates

          CCS '11 Paper Acceptance Rate 60 of 429 submissions, 14%;
          Overall Acceptance Rate 1,261 of 6,999 submissions, 18%

          Upcoming Conference

          CCS '25

          Contributors

          Other Metrics

          Bibliometrics & Citations

          Bibliometrics

          Article Metrics

          • Downloads (Last 12 months)4
          • Downloads (Last 6 weeks)0
          Reflects downloads up to 14 Feb 2025

          Other Metrics

          Citations

          Cited By

          View all
          • (2015)Protection Goals for Privacy EngineeringProceedings of the 2015 IEEE Security and Privacy Workshops10.1109/SPW.2015.13(159-166)Online publication date: 21-May-2015

          View Options

          Login options

          View options

          PDF

          View or Download as a PDF file.

          PDF

          eReader

          View online with eReader.

          eReader

          Figures

          Tables

          Media

          Share

          Share

          Share this Publication link

          Share on social media