Papers tagged as Pairings
  1. An Efficient Pairing-Based Shuffle Argument 2017 Asiacrypt NIZK Pairings
    Prastudy Fauzi and Helger Lipmaa and Janno Siim and Michal Zajac

    We construct the most efficient known pairing-based NIZK shuffle argument. It consists of three subarguments that were carefully chosen to obtain optimal efficiency of the shuffle argument:

    • A same-message argument based on the linear subspace QANIZK argument of Kiltz and Wee,

    • A (simplified) permutation matrix argument of Fauzi, Lipmaa, and ZajÄ…c,

    • A (simplified) consistency argument of Groth and Lu.

    We prove the knowledge-soundness of the first two subarguments in the generic bilinear group model, and the culpable soundness of the third subargument under a KerMDH assumption. This proves the soundness of the shuffle argument. We also discuss our partially optimized implementation that allows one to prove a shuffle of 100000
    ciphertexts in less than a minute and verify it in less than 1.5 minutes.

  2. Authenticated Encryption in the Face of Protocol and Side Channel Leakage 2017 Asiacrypt AuthenticatedEncryption Pairings SideChannels
    Guy Barwell and Daniel P. Martin and Elisabeth Oswald and Martijn Stam

    Authenticated encryption schemes in practice have to be robust against adversaries that have access to various types of leakage, for instance decryption leakage on invalid ciphertexts (protocol leakage), or leakage on the underlying primitives (side channel leakage). This work includes several novel contributions: we augment the notion of nonce-base authenticated encryption with the notion of continuous leakage and we prove composition results in the face of protocol and side channel leakage. Moreover, we show how to achieve authenticated encryption that is simultaneously both misuse resistant and leakage resilient, based on a sufficiently leakage resilient PRF, and finally we propose a concrete, pairing-based, instantiation of the latter.

  3. FAME: Fast Attribute-based Message Encryption 2017 ABE CCS Implementation Pairings
    Shashank Agrawal and Melissa Chase

    Time and again, attribute-based encryption has been shown to be the natural cryptographic tool for building various types of conditional access systems with far-reaching applications, but the deployment of such systems has been very slow. A central issue is the lack of an encryption scheme that can operate on sensitive data very efficiently and, at the same time, provides features that are important in practice.

    This paper proposes the first fully secure ciphertext-policy and key-policy ABE schemes based on a standard assumption on Type-III pairing groups, which do not put any restriction on policy type or attributes. We implement our schemes along with several other prominent ones using the Charm library, and demonstrate that they perform better on almost all parameters of interest.