Proofs that Yield All Languages Proof

First Page		Document Content
Date: 2014-03-23 11:48:58 Complexity classes Cryptographic protocols Probabilistic complexity theory Models of computation Interactive proof system Zero-knowledge proof NP IP Arthur–Merlin protocol Theoretical computer science Computational complexity theory Applied mathematics		Proofs that Yield All Languages Proof Add to Reading List Source URL: nakamotoinstitute.org Download Document from Source Website File Size: 2,90 MB Share Document on Facebook

	On the Robustness of some Cryptographic Protocols for Mobile Agent Protection Volker Roth Fraunhofer Institut f¨ur Graphische Datenverarbeitung Rundeturmstraße 6, 64283 Darmstadt, Germany DocID: 1uZJK - View Document
	Verifying Cryptographic Protocols in Applied Pi Calculus Mark Ryan Ben Smyth DocID: 1uXvn - View Document
	Secure Cryptographic Protocols for E-commerce Transaction on the Internet DocID: 1uDkO - View Document
	Type-Based Automated Verification of Authenticity in Cryptographic Protocols Daisuke Kikuchi and Naoki Kobayashi Graduate School of Information Sciences, Tohoku University {kikuchi,koba}@kb.ecei.tohoku.ac.jp DocID: 1u5Us - View Document
	Cryptographic schemes Protocols Specifications of primitives DocID: 1u4P2 - View Document