Aps and non-interactive witness indistinguishability from indistinguishability obfuscation

Nir Bitansky, Omer Paneth

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We present new constructions of two-message and onemessage witness-indistinguishable proofs (ZAPs and NIWIs). This includes: – ZAPs (or, equivalently, non-interactive zero-knowledge in the common random string model) from indistinguishability obfuscation and one-way functions. – NIWIs from indistinguishability obfuscation and one-way permutations. The previous construction of ZAPs [Dwork and Naor, FOCS 00] was based on trapdoor permutations. The two previous NIWI constructions were based either on ZAPs and a derandomization-type complexity assumption [Barak, Ong, and Vadhan CRYPTO 03], or on a specific number theoretic assumption in bilinear groups [Groth, Sahai, and Ostrovsky, CRYPTO 06].

Original languageEnglish (US)
Title of host publicationTheory of Cryptography - 12th Theory of Cryptography Conference, TCC 2015, Proceedings
EditorsYevgeniy Dodis, Jesper Buus Nielsen
PublisherSpringer Verlag
Pages401-427
Number of pages27
ISBN (Electronic)9783662464960
DOIs
StatePublished - 2015
Event12th Theory of Cryptography Conference, TCC 2015 - Warsaw, Poland
Duration: Mar 23 2015Mar 25 2015

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume9015
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

Other12th Theory of Cryptography Conference, TCC 2015
Country/TerritoryPoland
CityWarsaw
Period3/23/153/25/15

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'Aps and non-interactive witness indistinguishability from indistinguishability obfuscation'. Together they form a unique fingerprint.

Cite this