Efficient Designated-Verifier Non- Interactive Zero-Knowledge Proofs - PowerPoint PPT Presentation

Mar 26, 2024 •961 likes •1.25k views

Efficient Designated-Verifier Non- Interactive Zero-Knowledge Proofs of Knowledge Pyrros Chaidos, Geoffroy Couteau 1 /11 Zero-Knowledge Proof prover verifier Complete: if P knows a solution, V accepts Sound: if there is no solution, P

Efficient Designated-Verifier Non- Interactive Zero-Knowledge Proofs of Knowledge Pyrros Chaidos, Geoffroy Couteau 1 /11
Zero-Knowledge Proof prover verifier • Complete: if P knows a solution, V accepts • Sound: if there is no solution, P cannot convince V • Zero-Knowledge: V does not learn the solution 2 /11
Non-Interactive Zero- Knowledge Proof prover verifier • Complete: if P knows a solution, V accepts • Sound: if there is no solution, P cannot convince V • Zero-Knowledge: V does not learn the solution 3 /11
Non-Interactive Zero- Knowledge Proof of Knowledge prover verifier • Complete: if P knows a solution, V accepts • Sound: P must know a solution to convince V • Zero-Knowledge: V does not learn the solution 4 /11
Designated-Verifier NIZKPoK prover verifier • Complete: if P knows a solution, V accepts • Sound: P must know a solution to convince V • Zero-Knowledge: V does not learn the solution 4 /11
The NIZK Landscape Provably secure Hidden- bit model [BFM88] Practical Inefficient NIZKs Fiat- Shamir [FS86] Heuristic 5 /11
The NIZK Landscape Provably secure Hidden- Groth- bit model Sahai [BFM88] [GS07] Practical Inefficient NIZKs Fiat- Shamir [FS86] Heuristic 5 /11
The NIZK Landscape only from pairings Provably secure Hidden- Groth- bit model Sahai [BFM88] [GS07] Practical Inefficient NIZKs Fiat- Shamir [FS86] Heuristic 5 /11
The NIZK Landscape From Σ -protocols + Provably secure homomorphic encryption Hidden- Groth- DVNIZK bit model Sahai [DFN06] [BFM88] [GS07] Practical Inefficient NIZKs Fiat- Shamir [FS86] Heuristic 5 /11

Download Presentation

Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Designated Verifier Signature Schemes - An Overview Liina Kamm October 10, 2005 Structure

Designated Verifier Signature Schemes - An Overview Liina Kamm October 10, 2005 Structure The Jakobsson-Sako-Impagliazzo Scheme Security notions for DVS schemes DVS Scheme with tight reduction to DDH in NPRO Universal Designated

620 views • 42 slides

Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from

Motivation Research Question Results Conclusion Notes Construction of Universal Designated-Verifier Signatures and Identity-Based Signatures from Standard Signatures Siamak Shahandashti 1 Rei Safavi-Naini 2 1 SCSSE & CCISR, Uni

465 views • 46 slides

Designated Verifier Signatures: Attacks, New Definitions and Constructions Helger Lipmaa

Estonian Theory Days, Koke, Estonia Designated Verifier Signatures: Attacks, New Definitions and Constructions Helger Lipmaa Helsinki University of Technology, Finland Guilin Wang and Feng Bao Institute of Infocomm Research, Singapore Koke,

732 views • 37 slides

Lecture 17: Interactive Proofs Arijit Bishnu 23.04.2010 Introduction Probabilistic Verifier

Introduction Probabilistic Verifier Lecture 17: Interactive Proofs Arijit Bishnu 23.04.2010 Introduction Probabilistic Verifier Outline 1 Introduction 2 Probabilistic Verifier Introduction Probabilistic Verifier Outline 1 Introduction 2

866 views • 54 slides

AuCPace: Efficient Verifier-Based PAKE protocol tailored for the IIoT Bjrn Haase, Benot

Products Solutions Services AuCPace: Efficient Verifier-Based PAKE protocol tailored for the IIoT Bjrn Haase, Benot Labrique Endress + Hauser Conducta GmbH & Co. KG. Slide 1 07/22/2019 B. Haase, B. Labrique AuCPace: Efficient

1.21k views • 81 slides

Metamath Zero or: How to verify a verifier Mario Carneiro Carnegie Mellon University January 9,

Metamath Zero or: How to verify a verifier Mario Carneiro Carnegie Mellon University January 9, 2020 What is an interactive theorem prover? What is an interactive theorem prover? Interactive: You and the computer collaborate to

700 views • 49 slides

Zero-Knowledge Proofs Lecture 15 Interactive Proofs Interactive Proofs Interactive Proofs

Zero-Knowledge Proofs Lecture 15 Interactive Proofs Interactive Proofs Interactive Proofs Prover wants to convince verifier that x has some property Interactive Proofs Prover wants to convince verifier that x has some property i.e. x is in

3.29k views • 145 slides

Zero-Knowledge Proofs 1 Zero-Knowledge Proofs Lecture 15 1 Interactive Proofs 2 Interactive

Zero-Knowledge Proofs 1 Zero-Knowledge Proofs Lecture 15 1 Interactive Proofs 2 Interactive Proofs 2 Interactive Proofs Prover wants to convince verifier that x has some property 2 Interactive Proofs Prover wants to convince verifier

1.9k views • 174 slides

for Linear Algebra Christopher Hickey Graham Cormode University of Warwick Our Model

Efficient Interactive Proofs for Linear Algebra Christopher Hickey Graham Cormode University of Warwick Our Model Streaming Interactive Proofs Data, S, in the Cloud F(S) = ? F(S) Conversation Helper Verifier Completeness An

490 views • 20 slides

Developmental Services In Vermont Designated Agency System The Designated System operates on

1/10/2019 Developmental Services In Vermont Designated Agency System The Designated System operates on a zero reject premise Ten Designated Agencies each responsible for a geographic region Eligibility Determination Assessment of

314 views • 5 slides

GAN Compression: Efficient Architectures for Interactive Conditional GANs Muyang Li 1,3 , Ji Lin 1

GAN Compression: Efficient Architectures for Interactive Conditional GANs Muyang Li 1,3 , Ji Lin 1 , Yaoyao Ding 1,3 , Zhijian Liu 1 , Jun-Yan Zhu 2 , and Song Han 1 1 Massachusetts Institute of Technology 2 Adobe Research. 3 Shanghai Jiao Tong

442 views • 15 slides

MIT 6.875 & Berkeley CS276 Foundations of Cryptography Lecture 16 Today: Non-Interactive

MIT 6.875 & Berkeley CS276 Foundations of Cryptography Lecture 16 Today: Non-Interactive Zero-Knowledge (NIZK) In Two Days: An Application of NIZK NP Proofs For the NP-complete problem of graph 3-coloring Proof = Verifier V checks:

538 views • 37 slides

Designated Agency Funding Structure Vermont Care Partners Designated and Special Services

Designated Agency Funding Structure Vermont Care Partners Designated and Special Services Agencies Finance Directors December 2, 2015 What Do We Do? Designated Agencies (DAs) have a statutory responsibility to meet all of the

838 views • 26 slides

Building a Haskell Verifier out of component theories Dick Kieburtz WG2.8, Frauenchiemsee, June

Building a Haskell Verifier out of component theories Dick Kieburtz WG2.8, Frauenchiemsee, June 2009 Why a verifier for Haskell, in particular? Feasibility: Theres a recognized, stable version that is pretty well defined Haskell

403 views • 19 slides

An Efficient Posterior Regularized Latent Variable Model for Interactive Sound Source

An Efficient Posterior Regularized Latent Variable Model for Interactive Sound Source Separation Nicholas J. Bryan, Stanford University Gautham J. Mysore, Adobe Research ICML 2013 Sound Check 1 Motivation I Real world

465 views • 21 slides

DESIGNATED OUTDOOR REFRESHMENT AREA (DORA) WHAT IS A DORA? A specifically designated area that

JULY 22, 2020 DESIGNATED OUTDOOR REFRESHMENT AREA (DORA) WHAT IS A DORA? A specifically designated area that allows patrons over the age of 21 to purchase alcoholic beverages from an establishment and carry them within a clearly defined area

188 views • 16 slides

Advanced Systems Security: Linux Security Modules Trent Jaeger Systems and Internet

Systems and Internet Infrastructure Security Network and Security Research Center Department of Computer Science and Engineering Pennsylvania State University, University Park PA Advanced Systems Security: Linux Security Modules Trent

872 views • 30 slides

Establishing an AAI service in DFN Ulrich Khler, DFN-Verein kaehler@dfn.de Jrgen

Establishing an AAI service in DFN Ulrich Khler, DFN-Verein kaehler@dfn.de Jrgen Rauschenbach, DFN-Verein jrau@dfn.de Events and plans March 2006: 1. Meeting of an advisory group and early adopters: Libraries, GRIDs, eLearning,

408 views • 12 slides

three forces and moments Forces & Moments 1 Architectural Structures F2018abn Lecture 3

A RCHITECTURAL S TRUCTURES : F ORM, B EHAVIOR, AND D ESIGN A RCH 331 D R. A NNE N ICHOLS F ALL 2018 lecture three forces and moments Forces & Moments 1 Architectural Structures F2018abn Lecture 3 ARCH 331 Structural Math quantify

649 views • 60 slides

mu-differentiability of an internal function Ricardo Almeida and V tor Neves University of

mu-differentiability of an internal function Ricardo Almeida and V tor Neves University of Aveiro, Portugal May 2006 Definition [Reeken, 1992] Let E and F be normed spaces, U E open set and f : U F an internal function. f

327 views • 17 slides

iLab Dynamic Routing Florian Wohlfart wohlfart@in.tum.de Chair of Network Architectures and

iLab Dynamic Routing Florian Wohlfart wohlfart@in.tum.de Chair of Network Architectures and Services Department of Informatics Technical University of Munich Lab 3 18ss 1 / 42 Outline Recap Background: Internet Architecture Internet

780 views • 61 slides

Uniform Interpolation and Proof Systems Rosalie Iemhoff Utrecht University Workshop on

Uniform Interpolation and Proof Systems Rosalie Iemhoff Utrecht University Workshop on Admissible Rules and Unification II Les Diablerets, February 2, 2015 1 / 12 Proof systems An old question: When does a logic have a decent proof system? 2

624 views • 50 slides

On approximate geometric k - clustering Jiri Matousek DCG 2000 Problem Given n -point set

On approximate geometric k - clustering Jiri Matousek DCG 2000 Problem Given n -point set and k>1 find a partition of minimum cost Geometric cost function Approximately

607 views • 21 slides

NCKU Programming Contest Training Course Strong Connected Component(SCC) 20 18 /0 4 / 25 Syuan-Yi

NCKU Programming Contest Training Course Strong Connected Component(SCC) 20 18 /0 4 / 25 Syuan-Yi Lin ( petermouse ) petermouselin @gmail.com Department of Computer Science and Information Engineering National Cheng Kung University Tainan, Taiwan

1.06k views • 105 slides