Sub-linear Size Pairing-Based Non-interactive Zero-Knowledge Arguments Jens Groth University College London TexPoint fonts used in EMF. Read the TexPoint.

Slides:

Advertisements

Similar presentations

Perfect Non-interactive Zero-Knowledge for NP

Advertisements

Short Pairing-based Non-interactive Zero-Knowledge Arguments Jens Groth University College London TexPoint fonts used in EMF. Read the TexPoint manual.

Simulation-sound NIZK Proofs for a Practical Language and Constant Size Group Signatures Jens Groth University of California Los Angeles Presenter: Eike.

Non-interactive Zero- Knowledge Arguments for Voting Jens Groth UCLA.

Short Non-interactive Zero-Knowledge Proofs

A Verifiable Secret Shuffle of Homomorphic Encryptions Jens Groth UCLA On ePrint archive:

Multi-Query Computationally-Private Information Retrieval with Constant Communication Rate Jens Groth, University College London Aggelos Kiayias, University.

Lower Bounds for Non-Black-Box Zero Knowledge Boaz Barak (IAS*) Yehuda Lindell (IBM) Salil Vadhan (Harvard) *Work done while in Weizmann Institute. Short.

Efficient Zero-Knowledge Argument for Correctness of a Shuffle Stephanie Bayer University College London Jens Groth University College London.

Allison Lewko TexPoint fonts used in EMF.

Efficient Non-interactive Proof Systems for Bilinear Groups Jens Groth University College London Amit Sahai University of California Los Angeles TexPoint.

Efficient Non-Interactive Zero Knowledge Arguments for Set Operations Prastudy Fauzi, Helger Lipmaa, Bingsheng Zhang University of Tartu, University of.

Efficient Zero-Knowledge Proof Systems Jens Groth University College London.

Probabilistically checkable proofs, hidden random bits and non-interactive zero-knowledge proofs Jens Groth University College London TexPoint fonts used.

1 Identity-Based Zero-Knowledge Jonathan Katz Rafail Ostrovsky Michael Rabin U. Maryland U.C.L.A. Harvard U.

Rennes, 24/10/2014 Cristina Onete CIDRE/ INRIA Sigma Protocols and (Non-Interactive) Zero Knowledge.

13. Oktober 2010 | Dr.Marc Fischlin | Kryptosicherheit | 1 Adaptive Proofs of Knowledge in the Random Oracle Model 21. PKC 2015 Marc Fischlin joint work.

Sub-linear Zero-Knowledge Argument for Correctness of a Shuffle Jens Groth University College London Yuval Ishai Technion and University of California.

Efficient Zero-Knowledge Proof Systems Jens Groth University College London.

Efficient Zero-Knowledge Proof Systems Jens Groth University College London FOSAD 2014.

Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups Masayuki Abe, NTT Jens Groth, University College London Kristiyan Haralambiev, NYU.

Non-interactive Zaps and New Techniques for NIZK Jens Groth Rafail Ostrovsky Amit Sahai University of California Los Angeles.

A Parallel Repetition Theorem for Any Interactive Argument Iftach Haitner Microsoft Research TexPoint fonts used in EMF. Read the TexPoint manual before.

CS426Fall 2010/Lecture 351 Computer Security CS 426 Lecture 35 Commitment & Zero Knowledge Proofs.

One-out-of-Many Proofs: Or How to Leak a Secret and Spend a Coin Jens Groth University College London Markulf Kohlweiss Microsoft Research TexPoint fonts.

Ring Signatures of Sub- linear Size without Random Oracles Nishanth Chandran Jens Groth Amit Sahai University of California Los Angeles TexPoint fonts.

1 Zaps and Apps Cynthia Dwork Microsoft Research Moni Naor Weizmann Institute of Science.

Introduction to Modern Cryptography, Lecture 7/6/07 Zero Knowledge and Applications.

Non-interactive and Reusable Non-malleable Commitments Ivan Damgård, BRICS, Aarhus University Jens Groth, Cryptomathic A/S.

Zero Knowledge Proofs. Interactive proof An Interactive Proof System for a language L is a two-party game between a verifier and a prover that interact.

The Power of Randomness in Computation 呂及人中研院資訊所.

K-Anonymous Message Transmission Luis von Ahn Andrew Bortz Nick Hopper The Aladdin Center Carnegie Mellon University.

Linear Algebra with Sub-linear Zero-Knowledge Arguments Jens Groth University College London TexPoint fonts used in EMF. Read the TexPoint manual before.

PRESENTED BY CHRIS ANDERSON JULY 29, 2009 Using Zero Knowledge Proofs to Validate Electronic Votes.

Quadratic Residuosity and Two Distinct Prime Factor ZK Protocols By Stephen Hall.

Fine-Tuning Groth-Sahai Proofs Alex Escala Scytl Secure Electronic Voting Jens Groth University College London.

Pairing-Based Non-interactive Proofs Jens Groth University College London Joint work with Rafail Ostrovsky and Amit Sahai Thanks also to Brent Waters TexPoint.

Optimistic Mixing for Exit-Polls Philippe Golle, Stanford Sheng Zhong, Yale Dan Boneh, Stanford Markus Jakobsson, RSA Labs Ari Juels, RSA Labs.

Efficient Zero-Knowledge Proofs Jens Groth University College London.

Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures Masayaki Abe, NTT Jens Groth, University College London Miyako Ohkubo, NICT.

Fall 2004/Lecture 201 Cryptography CS 555 Lecture 20-b Zero-Knowledge Proof.

Public Key Encryption with keyword Search Author: Dan Boneh Rafail Ostroversity Giovanni Di Crescenzo Giuseppe Persiano Presenter: 陳昱圻.

SANDRA GUASCH CASTELLÓ PHD EVOTING WORKSHOP LUXEMBOURG, 15-16/10/2012 SUPERVISOR: PAZ MORILLO BOSCH Verifiable Mixnets.

Zero-Knowledge Argument for Polynomial Evaluation with Applications to Blacklists Stephanie Bayer Jens Groth University College London TexPoint fonts used.

New Techniques for NIZK Jens Groth Rafail Ostrovsky Amit Sahai University of California Los Angeles.

Copyright (c) 2012 NTT Secure Platform Labs. Group to Group Commitments Do Not Shrink Masayuki ABE Kristiyan Haralambiev Miyako Ohkubo 1.

Non-interactive quantum zero-knowledge proofs

1 Efficient Ring Signatures Without Random Oracles Hovav Shacham and Brent Waters.

Based on work with: Sergey Gorbunov and Vinod Vaikuntanathan Homomorphic Commitments & Signatures Daniel Wichs Northeastern University.

1 Compact Group Signatures Without Random Oracles Xavier Boyen and Brent Waters.

Pairing-Based Non-interactive Zero-Knowledge Proofs Jens Groth University College London Based on joint work with Amit Sahai.

Verifiable Outsourcing of Computation Ron Rothblum.

Zero-Knowledge Proofs Ben Hosp. Classical Proofs A proof is an argument for the truth or correctness of an assertion. A classical proof is an unambiguous.

Cryptographic Shuffles Jens Groth University College London TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AAAAAAAAAAAAA.

On the Size of Pairing-based Non-interactive Arguments

Jens Groth, University College London

Linear Algebra with Sub-linear Zero-Knowledge Arguments

Perfect Non-interactive Zero-Knowledge for NP

cryptographic protocols 2014, lecture 14 Groth-Sahai proofs

Shorter Quasi-Adaptive NIZK Proofs for Linear Subspaces

A shuffle argument secure in the generic model

CRYPTOGRAPHY קריפטוגרפיה Thu 15:45-18:15.

cryptographic protocols 2014, lecture 12 Getting full zero knowledge

cryptographic protocols 2016, lecture 16 Groth-Sahai proofs

CSE 321 Discrete Structures

Short Pairing-based Non-interactive Zero-Knowledge Arguments

CSE 321 Discrete Structures

Towards a Classification of Non-interactive Computational Assumptions in Cyclic Groups Essam Ghadafi University of the West of England Jens Groth University.

Jens Groth and Mary Maller University College London

Presentation transcript:

Sub-linear Size Pairing-Based Non-interactive Zero-Knowledge Arguments Jens Groth University College London TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: A A AAAAA A A A A A A

Motivation VoterOfficial We can only accept correctly formatted votes Attaching encrypted vote to this

Non-interactive zero-knowledge proof VoterOfficial Ok, we will count your vote Attaching encrypted vote to this + NIZK proof that correct format Soundness: Vote is correct Zero-knowledge: Vote is secret

Applications of NIZK proofs Ring signatures Group signatures Anonymous credentials Verifiable encryption Voting...

Related work CRSSizeProver comp.Verifier comp. Kilian-PetrankO(Nk 2 ) group O(Nk 2 ) expoO(Nk 2 ) mults Trapdoor permutationsStat. SoundComp. ZK GOSO(1) groupO(N) groupO(N) expoO(N) pairings Subgroup decisionPerfect soundComp. ZK Abe-FehrO(1) groupO(N) groupO(N) expoO(N) pairings Dlog & knowledge of expo.Comp. soundPerfect ZK Interactive +O(√N) O(N) mults Fiat-ShamirDlog and random oracleComp. soundPerfect ZK This workO(N 3/4 ) group O(N 5/4 ) multsO(N) mults Generic groupComp. soundPerfect ZK

Our contribution Perfect completeness Perfect zero-knowledge Computational soundness –Generic group model Short and efficient to verify CRSSizeProver comp.Verifier comp. Binary circuit5N 3/4 group120N 3/4 group73N 5/4 mults27N mults Arithmetic circuit5N 3/4 group117N 3/4 group33N 5/4 expos27N mults

Common reference string Bilinear group Commitment key CRS for knowledge CRS for products CRS for permutations within commitments CRS for rotations between commitments

Commitment with knowledge Commitment Argument of knowledge Verify Only one group element to commit to n elements

Circuit... Non-interactive product argument

Product argument CRS for products Soundness

Conclusion NIZK argument of knowledge –perfect completeness –perfect zero-knowledge –computational soundness Short and efficient to verify CRSSizeProver comp.Verifier comp. Binary circuit5N 3/4 group120N 3/4 group73N 5/4 mults27N mults Arithmetic circuit5N 3/4 group117N 3/4 group33N 5/4 expos27N mults CRS O(N 3(1-ε) ) and Size O(N ε ) Untrusted setup: Short perfect Zaps Co-soundness: Standard q-assumption