Non-interactive Designated Verifier Proofs and Undeniable Signatures Caroline Kudla? and Kenneth G. Paterson Information Security Group Royal Holloway, University of London, UK {c.j.kudla,kenny.paterson - 98.6 - Document - PDFSEARCH.IO

First Page		Document Content
Date: 2005-09-06 11:06:02 Ring signature Designated verifier signature Zero-knowledge proof NP Undeniable signature Commitment scheme IP Public-key cryptography Probabilistically checkable proof Cryptography Digital signature Proof of knowledge		Non-interactive Designated Verifier Proofs and Undeniable Signatures Caroline Kudla? and Kenneth G. Paterson Information Security Group Royal Holloway, University of London, UK {c.j.kudla,kenny.paterson}@rhul.ac.uk Add to Reading List Source URL: www.isg.rhul.ac.uk Download Document from Source Website File Size: 218,26 KB Share Document on Facebook

	Randomization, random walks, derandomization, expansion April 12, L´ aszl´ o Babai. Monte Carlo algorithms in graph isomorphism testing. DocID: 1rgOi - View Document
	SelectNet_Manual_v2_April_2012.pdf DocID: 1qMoc - View Document
	WV Public Employees Insurance Agency Frequently Asked Questions on Picking a Primary Care Provider Q. Why is PEIA making me pick a physician? DocID: 1qjEP - View Document
	Interactive proofs April 12, L´ aszl´ o Babai. Trading group theory for randomness. In Proc. 17th STOC, pages 421–429. ACM Press, 1985. doi:22192. DocID: 1oP1q - View Document
	Inapproximability of Combinatorial Optimization Problems Luca Trevisan∗ arXiv:cs/0409043v1 [cs.CC] 24 SepJuly 27, 2004 DocID: 1mroB - View Document