<--- Back to Details
First PageDocument Content
Complexity classes / Cryptographic protocols / Zero-knowledge proof / Interactive proof system / Soundness / NP / IP / Commitment scheme / P/poly / Theoretical computer science / Computational complexity theory / Cryptography
Date: 2014-12-18 08:37:34
Complexity classes
Cryptographic protocols
Zero-knowledge proof
Interactive proof system
Soundness
NP
IP
Commitment scheme
P/poly
Theoretical computer science
Computational complexity theory
Cryptography

Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin†

Add to Reading List

Source URL: eprint.iacr.org

Download Document from Source Website

File Size: 502,86 KB

Share Document on Facebook

Similar Documents

Education / Academia / Knowledge / Grey literature / Rhetoric / Theses / Thesis / Doctor of Philosophy / Academic degree / Master of Philosophy / Graduate school / Master of Arts

  S H O R T   C O U R S E   F O R   P O S T G R A D U A T E   S T U D E N T S   A C A D E M I C   W R I T I N G   AIM   This   course   aims   to   help   MA/MSc/MPhil  

DocID: 1qXtZ - View Document

Chemistry / Polymers / Organic semiconductors / Materials science / Molecular electronics / Organic polymers / Conductive polymers / Photoresist / Polymer / Poly / Photolithography / Polythiophene

In-situ synthesis of conducting polymers into patternable polymer matrices Pedro J. rodríguez-Cantó1, Rafael Abargues2, Raúl García-Calzada1, and Juan P. Martínez-Pastor1 1 Instituto de Ciencia de los Materiales, Un

DocID: 1qRHm - View Document

POWER-V DXT S N O W P L O W Steel DXT Poly DXT

DocID: 1qx1J - View Document

Chemistry / Matter / Optical materials / Parylene / Polymers / Materials science / Thin film deposition / Biomaterials / Microtechnology / Poly / LIGA / Thin film

Characterization of Biocompatible Parylene-C Coatings for BIOMEMS Applications Quoc P. Nguyen a,*, Jost Goettert a, William T. Monroe b, Varshni Singh a a Center for Advanced Microstructures and Devices (CAMD), Louisian

DocID: 1qolS - View Document

Theory of computation / Complexity classes / Mathematics / Theoretical computer science / Valuation / Submodular set function / NC / NP / Reduction / P/poly

On the Hardness of Being Truthful Christos Papadimitriou Michael Schapira

DocID: 1q81r - View Document