A note on universal composable zero-knowledge in the common reference string model-Reference-Cited by-同舟云学术

A note on universal composable zero-knowledge in the common reference string model

Published:2009-03 Issue:11 Volume:410 Page:1099-1108
ISSN:0304-3975
Container-title:Theoretical Computer Science
language:en
Short-container-title:Theoretical Computer Science

Author:

Yao Andrew C.C.,Yao Frances F.,Zhao Yunlei

Publisher

Elsevier BV

Subject

General Computer Science,Theoretical Computer Science

Reference35 articles.

1. B. Barak, M. Prabhakaran, A. Sahai, Concurrent non-malleable zero-knowledge, Cryptology ePrint Archive, Report No. 2006/355, Extended abstract appears in FOCS 2006

2. M. Blum, Coin flipping by telephone, in: Proc. IEEE Spring COMPCOM, 1982, pp. 133–137

3. M. Blum, How to prove a theorem so no one else can claim it, in: Proceedings of the International Congress of Mathematicians, Berkeley, California, USA, 1986, pp. 1444–1451

4. On defining proofs of knowledge;Bellare,1992

5. M. Bellare, O. Goldreich, On probabilistic versus deterministic provers in the definition of proofs of knowledge, Electronic Colloquium on Computational Complexity, 13 (136), 2006, Available also from Cryptology ePrint Archive, Report No. 2006/359

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. A second note on the feasibility of generalized universal composability;Mathematical Structures in Computer Science;2016-06-08

2. RFID Security and Privacy;Synthesis Lectures on Information Security, Privacy, and Trust;2013-12-26

3. A Survey on Privacy Frameworks for RFID Authentication;IEICE Transactions on Information and Systems;2012

4. A zero-knowledge based framework for RFID privacy;Journal of Computer Security;2011-12-23

5. Vaudenay’s Privacy Model in the Universal Composability Framework: A Case Study;Communications in Computer and Information Science;2011