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

메뉴 건너뛰기

Journal of Cryptology

Volumn 4, Issue 2, 1991, Pages 75-122

Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority

(1) Beaver, Donald a

a LUCENT TECHNOLOGIES (United States)

Author keywords

Distributed computing; Fault tolerance; Proof systems; Secret sharing; Zero knowledge

Indexed keywords

EID: 33746365751 PISSN: 09332790 EISSN: 14321378 Source Type: Journal
DOI: 10.1007/BF00196771 Document Type: Article

Times cited : (145)

References (31)

1
- 0023995534
- Arthur-Merlin Games: A Randomized Proof System, and a Hierarchy of Complexity Classes
- (1988) J. Comput. System Sci. , vol.36 , pp. 254-276
- Babai, L.¹ Moran, S.²

2
- 0024940038
- Non-Cryptographic Fault-Tolerant Computing in a Constant Expected Number of Rounds of Interaction
- ACM, New York
- (1989) Proc. PODC , pp. 201-209
- Bar-Ilan, J.¹ Beaver, D.²

3
- 0005260647
- Secure Multiparty Protocols Tolerating Half Faulty Processors
- ACM, New York
- (1989) Proceedings of Crypto 1989
- Beaver, D.¹

4
- 84934250610
- D. Beaver. Perfect Privacy for Two-Party Protocols. Proc. DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.). Preliminary version in Technical Report TR-11-89, Harvard University.

5
- 84934250607
- D. Beaver. Formal Definitions for Secure Distributed Protocols Proc. DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October, 1989, J. Feigenbaum, M. Merritt (eds.).

6
- 84934248598
- D. Beaver. Security, Fault Tolerance, and Communication Complexity in Distributed Systems. Ph.D. Thesis, Harvard University, 1990.

7
- 33745511846
- Hiding Instances in Multioracle Queries
- Lecture Notes in Computer Science, Springer-Verlag, Berlin
- (1990) Proc. 7th STACS , pp. 37-48
- Beaver, D.¹ Feigenbaum, J.²

8
- 84934248580
- D. Beaver, J. Feigenbaum, J. Kilian, P. Rogaway. Cryptographic Applications of Locally Random Reductions. Proc. Crypto 1990. Also appeared as AT&T Bell Laboratories Technical Memorandum, November 15, 1989.

9
- 84934248579
- D. Beaver, J. Feigenbaum, V. Shoup. Hiding Instances in Zero-Knowledge Proof Systems. Proc. Crypto 1990.

10
- 84934248577
- D. Beaver, S. Goldwasser. Multiparty Computation with Faulty Marjority. Proc. 30th FOCS, IEEE, New York, 1989, pp. 468–473.

11
- 84934248575
- D. Beaver, S. Haber, M. Yung. Protocols Secure Against Dynamic Adversaries. In preparation, 1990.

12
- 0025137207
- The Round Complexity of Secure Protocols
- ACM, New York
- (1990) Proc. 22nd STOC , pp. 503-513
- Beaver, D.¹ Micali, S.² Rogaway, P.³

13
- 84934248584
- J. Benaloh. Verifiable Secret Ballot Elections. Ph.D. Thesis, Yale University, 1987.

14
- 84898960610
- Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation
- ACM, New York
- (1988) Proc. 20th STOC , pp. 1-10
- Ben-Or, M.¹ Goldwasser, S.² Wigderson, A.³

15
- 84898947315
- Multiparty Unconditionally Secure Protocols
- ACM, New York
- (1988) Proc. 20th STOC , pp. 11-19
- Chaum, D.¹ Crépeau, C.² Damgård, I.³

16
- 0022199386
- Verifiable Secret Sharing and Achieving Simultaneity in the Presence of Faults
- ACM, New York
- (1985) Proc. 17th STOC , pp. 383-395
- Chor, B.¹ Goldwasser, S.² Micali, S.³ Awerbuch, B.⁴

17
- 0024860209
- A Zero-One Law for Boolean Privacy
- ACM, New York
- (1989) Proc. 21st STOC , pp. 62-72
- Chor, B.¹ Kushilevitz, E.²

18
- 84976655650
- Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model
- Springer-Verlag, Berlin
- (1988) Proc. Crypto 1987 , pp. 135-155
- Galil, Z.¹ Haber, S.² Yung, M.³

19
- 0024716009
- Minimum-Knowledge Interactive Proofs for Decision Problems
- (1989) SIAM J. Comput. , vol.18 , Issue.4 , pp. 711-739
- Galil, Z.¹ Haber, S.² Yung, M.³

20
- 0022914590
- Proofs that Yield Nothing but Their Validity and a Methodology of Cryptographic Protocol Design
- IEEE, New York
- (1986) Proc. 27th FOCS , pp. 174-187
- Goldreich, O.¹ Micali, S.² Wigderson, A.³

21
- 0023545076
- How to Play Any Mental Game, or A Completeness Theorem for Protocols with Honest Majority
- ACM, New York
- (1987) Proc. 19th STOC , pp. 218-229
- Goldreich, O.¹ Micali, S.² Wigderson, A.³

22
- 84934248583
- S. Goldwasser, L. Levin. Fair Computation of General Functions in Presence of Immoral Majority. Proc. Crypto 1990.

23
- 0024611659
- The Knowledge Complexity of Interactive Proof Systems
- (1989) SIAM J. Comput. , vol.18 , Issue.1 , pp. 186-208
- Goldwasser, S.¹ Micali, S.² Rackoff, C.³

24
- 0040597467
- Private Coins vs. Public Coins in Interactive Proof Systems
- ACM, New York
- (1986) Proc. 18th STOC , pp. 59-68
- Goldwasser, S.¹ Sipser, M.²

25
- 84934248582
- S. Haber, S. Micali. Personal communication, 1987.

26
- 84934248571
- J. Kilian, S. Micali, P. Rogaway. The Notion of Secure Computation. Unpublished manuscript, 1990.

27
- 33746824246
- Privacy and Communication Complexity
- IEEE, New York
- (1989) Proc. 30th FOCS , pp. 26-421
- Kushilevitz, E.¹

28
- 84934248573
- T. Rabin. Robust Sharing of Secrets When the Dealer is Honest or Cheating. Masters Thesis, Hebrew University, 1988.

29
- 0024859552
- Verifiable Secret Sharing and Multiparty Protocols with Honest Majority
- ACM, New York
- (1989) Proc. 21st STOC , pp. 73-85
- Rabin, T.¹ Ben-Or, M.²

30
- 84934248566
- P. Rogaway. The Round Complexity of Secure Protocols. Ph.D. Thesis, Massachusetts Institute of Technology, 1990.

31
- 0018545449
- How To Share a Secret
- (1979) Comm. ACM , vol.22 , pp. 612-613
- Shamir, A.¹

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