Constant-Round Concurrent Zero Knowledge From Falsifiable Assumptions

Abstract

We present a constant-round concurrent zero-knowledge protocol for NP. Our protocol is sound against uniform polynomial-time attackers, and relies on the existence of families of collision-resistant hash functions, and a new (but in our eyes, natural) falsifiable intractability assumption: Roughly speaking, that Micali's non-interactive CS-proofs are sound for languages in P.

Open PDF

Document Details

Document Type
Technical Report
Publication Date
Jan 01, 2013
Accession Number
ADA582576

Entities

People

  • Huijia Lin
  • Kai-Min Chung
  • Rafael Pass

Organizations

  • Cornell University

Tags

Communities of Interest

  • Cyber

DTIC Thesaurus Topics

  • Algorithms
  • Asymetric Encryption
  • Authentication
  • Automata
  • Coding
  • Collisions
  • Computational Complexity
  • Computer Science
  • Construction
  • Cryptography
  • Language
  • Polynomials
  • Probability
  • Random Variables
  • Security Protocols
  • Simulations
  • Simulators

Fields of Study

  • Computer science
  • Mathematics

Readers

  • Mathematical Modeling and Probability Theory.