Weizmann Logo
ECCC
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style



REPORTS > KEYWORD > TRAPDOOR COMMITMENTS:
Reports tagged with trapdoor commitments:
TR05-048 | 11th April 2005
Moti Yung, Yunlei Zhao

Constant-Round Concurrently-Secure rZK in the (Real) Bare Public-Key Model

Revisions: 3

We present constant-round concurrently secure (sound) resettable
zero-knowledge (rZK-CS) arguments in the bare public-key (BPK)
model. Our constructions deal with general NP ZK-arguments as well
as with highly efficient ZK-arguments for number-theoretic
languages, most relevant to identification scenarios. These are the
first constant-round protocols of ... more >>>




ISSN 1433-8092 | Imprint