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

First Page		Document Content
Date: 2005-11-30 14:18:39 Cryptographic protocols Trapdoor function Claw-free permutation One-way function Zero-knowledge proof XTR Mercurial Permutation Communications protocol Cryptography Public-key cryptography Commitment scheme		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 Add to Reading List Source URL: eprint.iacr.org Download Document from Source Website File Size: 158,02 KB Share Document on Facebook

	On the design and cryptanalysis of a one-way hash Carl Ellison Victor Miller Eran Tromer Rebecca Wright In this paper we describe a novel one-way hash function that is compliant with the NIST hash function competition dr DocID: 1t9VA - View Document
	Samuel M. Young, Jr. PhD Max Planck Research Group Leader Research Group Molecular Mechanisms of Synaptic Function Max Planck Florida Institute for Neuroscience One Max Planck Way Jupiter, Florida USA 33458 DocID: 1s4hy - View Document
	Samuel M. Young, Jr. PhD Max Planck Research Group Leader Research Group Molecular Mechanisms of Synaptic Function Max Planck Florida Institute for Neuroscience One Max Planck Way Jupiter, Florida USA 33458 DocID: 1rx8q - View Document
	Hoti to Construct Random Functions ODED GOLDREICH, SHAFI AND SILVIO MICALI GOLDWASSER, DocID: 1r1z1 - View Document