SCOPUS 정보 검색 플랫폼 - 논문 보기

메뉴 건너뛰기

Journal of Cryptology

Volumn 2, Issue 2, 1990, Pages 63-76

A discrete logarithm implementation of perfect zero-knowledge blobs

(3) Boyar, Joan F a Kurtz, Stuart A a Krentel, Mark W b

a UNIVERSITY OF CHICAGO (United States)

b RICE UNIVERSITY (United States)

Author keywords

Cryptographic protocols; Zero knowledge proof systems

Indexed keywords

MATHEMATICAL TECHNIQUES--NUMBER THEORY;

PRODUCT BLOB; ZERO KNOWLEDGE BLOBS;

CRYPTOGRAPHY;

EID: 0025056443 PISSN: 09332790 EISSN: 14321378 Source Type: Journal
DOI: 10.1007/BF00204448 Document Type: Article

Times cited : (48)

References (24)

1
- 84934219855
- L. Adleman and M. Huang. Recognizing primes in random polynomial time. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 462–469, 1987.

2
- 84934219856
- L. Babai. Trading group theory for randomness. In Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, pages 421–429, 1985.

3
- 84934219857
- E. Bach. Discrete logarithms and factoring. Technical Report 84/186, Computer Science Division, University of California, June 1984.

4
- 0023985412
- How to generate factored random numbers
- (1988) SIAM Journal on Computing , vol.17 , Issue.2 , pp. 179-193
- Bach, E.¹

5
- 84934219880
- M. Ben-Or, S. Goldwasser, and A. Widgerson. Completeness theorems for non-cryptographic fault-tolerant distributed computation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 1–10, 1988.

6
- 0021522644
- How to generate cryptographically strong sequences of pseudorandom bits
- (1984) SIAM Journal on Computing , vol.13 , pp. 850-864
- Blum, M.¹ Micali, S.²

7
- 0023646410
- Does CoNP have short interactive proofs?
- (1987) Information Processing Letters , vol.25 , pp. 127-132
- Boppana, R.¹ Håstad, J.² Zachos, S.³

8
- 0024303956
- Inferring sequences produced by pseudo-random number generators
- (1989) Journal of the ACM , vol.36 , pp. 129-141
- Boyar, J.¹

9
- 84934219881
- G. Brassard and D. Chaum. Personal communication, 1987.

10
- 0000867507
- Minimum disclosure proofs of knowledge
- (1988) Journal of Computer System Science , vol.37 , pp. 156-189
- Brassard, G.¹ Chaum, D.² Crépeau, C.³

11
- 84934219878
- G. Brassard and C. Crépeau. Nontransitive transfer of confidence: a perfect zero-knowledge interactive protocol for Sat and beyond. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 188–195, 1986.

12
- 0024012468
- Cryptanalysis: A survey of recent results
- (1988) Proceedings of the IEEE , vol.76 , pp. 578-593
- Brickell, E.¹ Odlyzko, A.²

13
- 84934219879
- D. Chaum. Demonstrating that a public predicate can be satisfied without revealing any information about how. In Crypto 86, pages 195–199, 1986.

14
- 84934219876
- D. Chaum, C. Crépeau, and I. Damgård. Multiparty unconditionally secure protocols. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pages 11–19, 1988.

15
- 84934219877
- D. Chaum, I. Damgård, and J. van de Graaf. Multiparty computations ensuring privacy of each party's input and correctness of the result. In Crypto 87, pages 87–119, 1987.

16
- 84934219884
- D. Chaum, J.-H. Evertse, and J. van de Graaf. An improved protocol for demonstrating possession of a discrete logarithm and some generalizations. In Euro Crypt 87, pages 127–141, 1987.

17
- 84934219885
- L. Fortnow. The complexity of perfect zero-knowledge. In Proceedings of the 19th Annual ACM Symposium on the Theory of Computing, pages 204–209, 1987.

18
- 0003603813
- Freeman, San Francisco
- (1979) Computers and Intractability, A Guide to the Theory ofNP-Completeness
- Garey, M.R.¹ Johnson, D.S.²

19
- 84934219882
- O. Goldreich, S. Micali, and A. Wigderson. Proofs that yield nothing but their validity and a methodology of cryptographic protocol design. In Proceedings of the 27th IEEE Symposium on the Foundations of Computer Science, pages 174–187, 1986.

20
- 84934219883
- S. Goldwasser, S. Micali, and C. Rackoff. The knowledge complexity of interactive proof-systems. In Proceedings of the 17th Annual ACM Symposium on the Theory of Computing, pages 291–304, 1985.

21
- 0024611659
- The knowledge complexity of interactive proof-systems
- (1989) SIAM Journal on Computing , vol.18 , pp. 186-208
- Goldwasser, S.¹ Micali, S.² Rackoff, C.³

22
- 0003766834
- fifth edition, Oxford University Press, Oxford
- (1979) An Introduction to the Theory of Numbers
- Hardy, G.E.¹ Wright, E.M.²

23
- 84919085619
- An improved algorithm for computing logarithms over GF(p) and its cryptographic significance
- (1978) IEEE Transactions on Information Theory , vol.24 , pp. 106-110
- Pohlig, S.¹ Hellman, M.E.²

24
- 84934219870
- A. Yao. Theory and applications of trapdoor functions. In Proceedings of the 23rd IEEE Symposium on the Foundations of Computer Science, pages 80–91, 1982.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.