Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Transaction of Fundamentals of Electronic Communications and Computer Science, E82-A(1):81--92, January 1999. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
First 50 documents Next 50
Cryptographic Randomized Response Techniques - Andris Ambainis Markus (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Transaction of Fundamentals of Electronic Communications and Computer Science, E82-A(1):81--92, January 1999.
A Handy Multi-Coupon System - Sebastien Canard Aline (2006) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. In B. S. Kaliski Jr., editor, Advances in Cryptology - Crypto '97, volume 1294 of Lecture Notes in Computer Science, pages 16--30. Springer-Verlag, 1997.
An Anonymous Authentication Scheme for Trusted Computing Platform - Ge (2005) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- Crypto, pages 16--30, 1997.
Designated Confirmer Signatures Revisited - Wikström (2006) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology Crypto '97, volume 1294 of Lecture Notes in Computer Science, pages 1630. Springer Verlag, 1997.
A Suite of ID-Based Threshold Ring Signature Schemes with.. - Au, Liu, Tsang, Wong (2005) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO 1997, volume 1294 of LNCS, pages 16--30, 1997.
An Effective Method to Implement Group Signature with Revocation - Ge (2005) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- Crypto, pages 16--30, 1997.
A Practical and Provably Secure - Coalition-Resistant Group Signature (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- CRYPTO '97, vol. 1297 of LNCS, pp. 16--30, Springer-Verlag, 1997.
Self-Escrowed Public-Key Infrastructures - Published In Song (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology, Crypto'97, LNCS 1294, pp. 16--30, Springer Verlag, 1997.
On the Security of A Group Signature Scheme - Jianhong Zhang And (2005) (Correct)
No context found.
E. Fujisaki and T. Okamoto.(1997) Statistical zero-knowledge protocols to prove modular polynomial relations. In: Advances in Cryptology - CRYPTO97, LNCS 1294, pages 16-30. Springer-Verlag, 1997.
Short (resp. Fast) CCA2-Fully-Anonymous Group Signatures Using.. - Wei (2005) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO'97, pages 16--30. Springer-Verlag, 1997.
A Practical and Provably Secure - Coalition-Resistant Group Signature (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- CRYPTO '97, vol. 1297 of LNCS, pp. 16--30, Springer-Verlag, 1997.
Self-Escrowed Public-Key Infrastructures - Published In Song (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology, Crypto'97, LNCS 1294, pp. 16--30, Springer Verlag, 1997.
Hidden Exponent RSA and Ecient Key - Distribution He Ge (2005) (Correct)
No context found.
Fujisaki, E., and Okamoto, T. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- Crypto (1997), pp. 16-- 30.
A Method to Implement Direct Anonymous Attestation - Ge (2006) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- Crypto, pages 16--30, 1997.
Efficient Mutual Data Authentication Using Manually.. - Laur, Asokan, Nyberg (2005) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski (Ed.) CRYPTO '97, pages 16--30, 1997.
Minimal Assumptions for Efficient Mercurial Commitments - Dodis (2005) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. S. Kaliski Jr., editor, Advances in Cryptology---CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 16--30. Springer-Verlag, 17--21 Aug. 1997.
A Privacy-Protecting Coupon System - Chen, Enzmann, Sadeghi, Schneider.. (2005) (1 citation) (Correct)
No context found.
E. Fujisaki, T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. Adv. in Cryptology - CRYPTO '97, LNCS 1294. Springer, 1997.
A Sender Verifiable Mix-Net and a New Proof of a Shuffle - Wikström (2005) (Correct)
No context found.
E. Fujisaki, T. Okamoto, Statistical Zero Knowledge Protocols to Prove Modular Polynomial Relations, Crypto 97, LNCS 1294, pp. 16-30, 1997.
Compact E-Cash - Camenisch, Hohenberger, Lysyanskaya (2005) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Burt Kaliski, editor, Advances in Cryptology --- CRYPTO '97, volume 1294 of LNCS, pages 16--30. Springer Verlag, 1997.
Forward-Secure Signatures with Optimal Signing and Verifying - Itkis, Reyzin (2001) (41 citations) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Burton S. Kaliski Jr., editor, Advances in Cryptology|CRYPTO '97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer-Verlag, 17-21 August 1997.
The One-More-RSA-Inversion Problems and the.. - Bellare.. (2001) (10 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski Jr., editor, Advances in Cryptology { CRYPTO ' 97, volume 1294 of Lecture Notes in Computer Science, pages 16-30. Springer-Verlag, Berlin Germany, 17-21 August 1997. 23
Cryptography in Subgroups of Z*_n - Groth (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In proceedings of CRYPTO '97, LNCS series, volume 1294, pages 16--30, 1997.
Separable Linkable Threshold Ring Signatures - Tsang, Wei, Chan, Au, Liu, Wong (2004) (1 citation) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In CRYPTO'97, pages 16--30. Springer-Verlag, 1997.
Hierarchical Group Signatures - Trolin, Wikström (2004) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology -- CRYPTO'97, Verlag, 1997.
Direct Anonymous Attestation - Brickell, Camenisch, Chen (2004) (13 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology --- CRYPTO '97, volume 1294 of LNCS, pages 16--30. Springer Verlag, 1997. 16
A Practical and Provably Secure Coalition-Resistant.. - Ateniese.. (2000) (63 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- CRYPTO '97, vol. 1297 of LNCS, pp. 16--30, Springer-Verlag, 1997.
Self-Escrowed Public-Key Infrastructures - Published In Song (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology, Crypto'97, LNCS 1294, pp. 16--30, Springer Verlag, 1997.
Direct Anonymous Attestation - Brickell, Camenisch, Chen (2004) (13 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In B. Kaliski, editor, Advances in Cryptology --- CRYPTO '97, volume 1294 of LNCS, pages 16--30. Springer Verlag, 1997.
Two-Party Generation of DSA Signatures - MacKenzie, Reiter (2004) (10 citations) (Correct)
No context found.
Fujisaki E, Okamoto T (1997) Statistical zero-knowledge protocols to prove modular polynomial relations. In: Proc. CRYPTO '97. LNCS, vol 1294. Springer, Berlin Heidelberg New York, pp 16--30
On the Security of a Group Signature Scheme with Forward Security - Wang (2003) (1 citation) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. In: Advances in Cryptology - CRYPTO'97, LNCS 1294, pages 16-30. Springer-Verlag, 1997. 11
RSA Problem - Rivest (2003) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Burton S. Kaliski Jr., editor, Proc. CRYPTO '97, volume 1294 of LNCS, pages 16--30. Springer-Verlag, 1997.
A Formal Proof of Zhu's Signature Scheme - Zhu (2003) (1 citation) (Correct)
No context found.
E. Fujisaki, T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. Crypto'97, LNCS 1294, Springer-verlag, 1997.
Sealed-bid Auctions with Efficient Bids - Nakanishi, Yamamoto, Sugiyama (Correct)
No context found.
E. Fujisaki and T. Okamoto, "Statistical zero knowledge protocols to prove modular polynomial relations," Advances in Cryptology --- CRYPTO '97, LNCS 1294, pp.16--30, Springer--Verlag, 1997.
On Diophantine Complexity and Statistical Zero-Knowledge Arguments - Lipmaa (2003) (1 citation) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical Zero-Knowledge Protocols to Prove Modular Polynomial Relations. IEICE Transaction of Fundamentals of Electronic Communications and Computer Science, E82A (1):81-92, January 1999.
On Protocol Security in the Cryptographic Model - Nielsen (2003) (1 citation) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. In Burt Kaliski, editor, Advances in Cryptology - Crypto '97, pages 16--30, Berlin, 1997. Springer-Verlag. Lecture Notes in Computer Science Volume 1294.
Blind, Auditable Membership Proofs - Sander, Ta-Shma, Yung (2000) (1 citation) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Burton S. Kaliski Jr., editor, Advances in Cryptology--- CRYPTO '97,volume 1294 of Lecture Notes in Computer Science, pages 16#30. Springer- erlag, 17#21 August 1997.
A Practical and Provably Secure Coalition-Resistant.. - Ateniese.. (2000) (63 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- CRYPTO '97, vol. 1297 of LNCS, pp. 16--30, Springer-Verlag, 1997.
Self-Escrowed Public-Key Infrastructures - Published In Song (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology, Crypto'97, LNCS 1294, pp. 16--30, Springer Verlag, 1997.
Constructing Optimistic Fair Exchange Protocols from Committed.. - Zhu (2003) (Correct)
No context found.
E. Fujisaki, T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. Crypto'97, LNCS 1294, Springer-verlag, 1997.
Efficient and Universally Composable Committed Oblivious.. - Garay, MacKenzie, Yang (2004) (1 citation) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology{CRYPTO '97, pp. 16-30, 1997.
Efficient and Universally Composable Committed Oblivious.. - Garay, MacKenzie, Yang (2004) (1 citation) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology--CRYPTO '97, pp. 16-30, 1997.
On the Notion of Pseudo-Free Groups - Rivest (2004) (5 citations) (Correct)
No context found.
Eiichiro Fujisaki and Tatsuaki Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Jr. Burton S. Kaliski, editor, Proc. CRYPTO '97, volume 1294 of LNCS, pages 16--30. Springer-Verlag, 1997.
A Verifiable Secret Sharing Scheme with Statistical.. - Tang, Liu, Wang (2003) (Correct)
No context found.
E Fujisaki, and T Okamoto, Statistical zero-knowledge protocols to prove modular polynomial relations. Advances in CryptologyCRYPTO '97, pp 16-30, Berlin: Springer, 1997.
On Simulation-Sound Trapdoor Commitments - MacKenzie, Yang (2003) (5 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology -- CRYPTO '97 (LNCS 1294), pp. 16-30, 1997.
A Practical and Provably Secure Coalition-Resistant.. - Ateniese.. (2000) (63 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical zero knowledge protocols to prove modular polynomial relations. In Advances in Cryptology --- CRYPTO '97, vol. 1297 of LNCS, pp. 16--30, Springer-Verlag, 1997.
Self-Escrowed Public-Key Infrastructures - Published In Song (Correct)
No context found.
E. Fujisaki and T. Okamoto. Statistical Zero-knowledge Protocols to Prove Modular Polynomial Relations. In Advances in Cryptology, Crypto'97, LNCS 1294, pp. 16--30, Springer Verlag, 1997.
Practical Verifiable Encryption and Decryption of Discrete.. - Camenisch, Shoup (2003) (17 citations) (Correct)
No context found.
E. Fujisaki and T. Okamoto, Statistical zero knowledge protocols to prove modular polynomial relations, Advances in Cryptology --- CRYPTO '97 (B. Kaliski, ed.), LNCS, vol. 1294, Springer Verlag, 1997, pp. 16--30.
Verifiably Committed Signatures Provably Secure in the Standard.. - Zhu (2003) (Correct)
No context found.
E. Fujisaki, T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. Crypto'97, LNCS 1294, Springer-verlag, 1997.
Verifiably Committed Signatures Provably Secure in the Standard.. - Zhu (2003) (Correct)
No context found.
E. Fujisaki, T. Okamoto. Statistical zero-knowledge protocols to prove modular polynomial relations. Crypto'97, LNCS 1294, Springer-verlag, 1997.
The Statistical Zero-knowledge Proof for Blum Integer Based.. - Tang, Liu, Liu (2003) (Correct)
No context found.
E Fujisaki, and T Okamoto, Statistical zero-knowledge protocols to prove modular polynomial relations. Advances in CryptologyCRYPTO '97, pp 16-30, Berlin: Springer, 1997.
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC