Efficient Sequential Aggregate Signed Data

First Page		Document Content
Date: 2012-04-18 06:08:45 Cryptography Permutations Mathematics Digital signature Claw-free permutation Permutation Random oracle FisherYates shuffle Pseudorandom permutation		Efficient Sequential Aggregate Signed Data Add to Reading List Source URL: www.neven.org Download Document from Source Website File Size: 329,15 KB Share Document on Facebook

	Very-efficient simulatable flipping of many coins into a well (and a new very-efficient extractable-and-equivocable commitment scheme) Luís T. A. N. Brandão∗ (Technical report – June 28, Abstract. Secure two DocID: 1lbHc - View Document
	How to Time-Stamp a Digital Document Stuart Haber W. Scott Stornetta DocID: 1kHPS - View Document
	Appeared in Advances in Cryptology { Crypto `86 (Proceedings), (A.M. Odlyzko ed.), Lecture Note in Computer ScienceSpringer Verlag, pages 104{110, 1987. Two Remarks Concerning the Goldwasser-Micali-Rivest Signatur DocID: 18rkR - View Document
	Secure Names for Bit-Strings Stuart Haber* W. Scott Stornetta* DocID: 16K7v - View Document
	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 DocID: 12WwO - View Document