Eﬃcient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2

First Page		Document Content
Date: 2011-03-20 04:03:37 Cryptography Public-key cryptography Commitment scheme Secret sharing Computational hardness assumption Digital signature Entropy XTR		Eﬃcient String-Commitment from Weak Bit-Commitment Kai-Min Chung1, , Feng-Hao Liu2, , Chi-Jen Lu3 , and Bo-Yin Yang3 1 2 Add to Reading List Source URL: precision.moscito.org Download Document from Source Website File Size: 261,54 KB Share Document on Facebook

	Proving Computational Security with a General-Purpose C Verifier A 5-Minute Talk Fran¸cois Dupressoir The Open University DocID: 1ga1k - View Document
	Formal Certification of Code-Based Cryptographic Proofs GILLES BARTHE and SANTIAGO ZANELLA BEGUELIN IMDEA Software, Madrid, Spain and BENJAMIN GREGOIRE DocID: 19hjI - View Document
	Matrix Computational Assumptions in Multilinear Groups Paz Morillo1 , Carla R`afols2 , and Jorge L. Villar1? 1 2 DocID: 18cff - View Document
	Practical Adaptive Oblivious Transfer from Simple Assumptions Matthew Green∗ Johns Hopkins University Susan Hohenberger† Johns Hopkins University DocID: 13pBd - View Document
	The k-BDH Assumption Family: Bilinear Map Cryptography from Progressively Weaker Assumptions Brent Waters† University of Texas at Austin DocID: 12Nkf - View Document