| Document Date: 2005-11-30 14:18:39
Open Document File Size: 158,02 KBShare Result on Facebook
City New York / / Country United States / / / Facility New York University / / IndustryTerm Σ-protocols / soft-verification algorithm / soft-commitment algorithm / polynomial-time algorithms / given Σ-protocol / Σ-protocol / hard-opening algorithm / verification algorithm / challenge-efficient Σ-protocols / commitment algorithm / challenge-efficient Σ-protocol / hard-commit algorithm / unconditional binary-challenge Σ-protocol / above mentioned protocols / generic protocol / soft-commit algorithm / soft-opening algorithm / certain Σ-protocols / zero-knowledge protocol / hard-verification algorithm / fake commitment algorithm / move protocol / e-th / binary Σ-protocol / much more efficient Σ-protocols / / MusicGroup Yes / / Organization New York University / Department of Computer Science / / Person Dario Catalano / Rabin / Ivan Visconti / LAIN M ERCURIAL / / Position extractor / / ProvinceOrState New York / / Technology Fiat-Shamir protocol / three move protocol / soft-verification algorithm / hard-opening algorithm / soft-commit algorithm / certain Σ-protocols / PPT algorithm / public key / given Σ-protocol / corresponding algorithms / two-stage opining protocol / polynomial-time algorithms / soft-commitment algorithm / real protocol / even binary Σ-protocol / above mentioned protocols / verification algorithm / unconditional binary-challenge Σ-protocol / zero-knowledge protocol / generic protocol / 4 Schnorr protocol / hard-verification algorithm / hard-commit algorithm / commitment algorithm / opening algorithm / corresponding Σ-protocol / Schnorr protocol / four algorithms / soft-opening algorithm / two algorithms / 2 2.1 Definitions Σ-Protocols / fake commitment algorithm / /
SocialTag |
Minimal Assumptions for Efficient Mercurial Commitments∗ Yevgeniy Dodis† Abstract Mercurial commitments were introduced by Chase et al. [8] and form a key building block for constructing zero-knowledge sets (introduc