SCOPUS 정보 검색 플랫폼

Proceedings New Security Paradigms Workshop

Volumn Part F129230, Issue , 1998, Pages 92-106

Server-assisted cryptography

(1) Beaver, Donald a,b

a IBM Transarc Corp (United States)

b CertCo (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ECONOMIC AND SOCIAL EFFECTS;

CRYPTOGRAPHIC RESOURCES; DO IT YOURSELF; INFORMATION FLOWS; SECRET SHARING; SERVICE PROVIDER; THIRD PARTIES; THIRD-PARTY SERVICE PROVIDERS; TRUST RELATIONSHIP;

CRYPTOGRAPHY;

EID: 84986251750 PISSN: None EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/310889.310923 Document Type: Conference Paper

Times cited : (17)

References (37)

1
- 85029224093
- Oblivious secret computation
- December
- D. Beaver. "Oblivious Secret Computation." Harvard University TR-12-87, December 1987.
- (1987) Harvard University TR-12-87
- Beaver, D.¹

2
- 33746365751
- Secure multiparty protocols and zero-knowledge proof systems tolerating a faulty minority
- D. Beaver. "Secure Multiparty Protocols and Zero-Knowledge Proof Systems Tolerating a Faulty Minority." J. Cryptology 4:2 1991, 75-122.
- (1991) J. Cryptology , vol.4 , Issue.2 , pp. 75-122
- Beaver, D.¹

3
- 85029542707
- Foundations of secure interactive computing
- Springer-Verlag LNCS 576
- D. Beaver. "Foundations of Secure Interactive Computing." Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 377-391.
- (1992) Advances in Cryptology - Crypto '91 Proceedings , pp. 377-391
- Beaver, D.¹

4
- 84933507780
- Efficient multiparty protocols using circuit randomization
- Springer-Verlag LNCS 576
- D. Beaver. "Efficient Multiparty Protocols Using Circuit Randomization." Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 420-432.
- (1992) Advances in Cryptology - Crypto '91 Proceedings , pp. 420-432
- Beaver, D.¹

5
- 84928743703
- Precomputing oblivious transfer
- Springer-Verlag LNCS 963
- D. Beaver. "Precomputing Oblivious Transfer." Advances in Cryptology - Crypto '95 Proceedings, Springer-Verlag LNCS 963, 1995, 97-109.
- (1995) Advances in Cryptology - Crypto '95 Proceedings , pp. 97-109
- Beaver, D.¹

6
- 85029220668
- Manuscript
- D. Beaver. "Fair Exchange Agents." Manuscript, 1996.
- (1996) Fair Exchange Agents
- Beaver, D.¹

7
- 0030679850
- Commodity-based cryptography
- ACM
- th STOC, ACM, 1997, 446-455.
- (1997) th STOC , pp. 446-455
- Beaver, D.¹

8
- 85032877753
- Non-interactive oblivious transfer and applications
- Springer-Verlag LNCS 435
- M. Bellare, S. Micali. "Non-Interactive Oblivious Transfer and Applications." Advances in Cryptology - Crypto '89 Proceedings, Springer-Verlag LNCS 435, 1990, 547-557.
- (1990) Advances in Cryptology - Crypto '89 Proceedings , pp. 547-557
- Bellare, M.¹ Micali, S.²

9
- 84969361843
- Practical quantum oblivious transfer
- Springer Verlag LNCS 576
- C. Bennett, G. Brassard, C. Crépeau, M. Skubiszewska. "Practical Quantum Oblivious Transfer." Advances in Cryptology - Crypto '91 Proceedings, Springer Verlag LNCS 576, 1992, 351-366.
- (1992) Advances in Cryptology - Crypto '91 Proceedings , pp. 351-366
- Bennett, C.¹ Brassard, G.² Crépeau, C.³ Skubiszewska, M.⁴

10
- 84898960610
- Completeness theorems for non-cryptographic fault-tolerant distributed computation
- ACM 1988
- th STOC, ACM, 1988, 1988, 1-10.
- (1988) th STOC , pp. 1-10
- Ben-Or, M.¹ Goldwasser, S.² Wigderson, A.³

11
- 85062838317
- Safeguarding cryptographic keys
- NY
- G. R. Blakley. "Safeguarding Cryptographic Keys." Proceedings of AFIPS 1979 National Computer Conference, NY 48, 1979, 313-317.
- (1979) Proceedings of AFIPS 1979 National Computer Conference , vol.48 , pp. 313-317
- Blakley, G.R.¹

12
- 84976804419
- How to exchange (Secret) keys
- May
- M. Blum. "How to Exchange (Secret) Keys." ACM Trans. Comput. Sys. 1:2 May 1983, 175-193.
- (1983) ACM Trans. Comput. Sys , vol.1 , Issue.2 , pp. 175-193
- Blum, M.¹

13
- 0022716288
- A simple unpredictable pseudo-random number generator
- May
- L. Blum, M. Blum, M. Shub. "A Simple Unpredictable Pseudo-Random Number Generator." SIAM J. on Computing 15:2 May 1986, 364-383.
- (1986) SIAM J. on Computing , vol.15 , Issue.2 , pp. 364-383
- Blum, L.¹ Blum, M.² Shub, M.³

14
- 1842809103
- Sorting out zero-knowledge
- Springer-Verlag LNCS 434
- G. Brassard, C. Crépeau. "Sorting Out Zero-Knowledge." Advances in Cryptology - Eurocrypt '89 Proceedings, Springer-Verlag LNCS 434, 1990, 150-154.
- (1990) Advances in Cryptology - Eurocrypt '89 Proceedings , pp. 150-154
- Brassard, G.¹ Crépeau, C.²

15
- 0000867507
- Minimum disclosure proofs of knowledge
- G. Brassard, D. Chaum, C. Crépeau. "Minimum Disclosure Proofs of Knowledge." J. Comput. Systems Sci. 37, 1988, 156-189.
- (1988) J. Comput. Systems Sci. , vol.37 , pp. 156-189
- Brassard, G.¹ Chaum, D.² Crépeau, C.³

16
- 84898947315
- Multiparty unconditionally secure protocols
- ACM 1988
- th STOC, ACM, 1988, 1988, 11-19.
- (1988) th STOC , pp. 11-19
- Chaum, D.¹ Crépeau, C.² Damgaard, I.³

17
- 0012610677
- Limits on the security of coin flips when half the processors are faulty
- ACM
- th STOC, ACM, 1986, 364-370.
- (1986) th STOC , pp. 364-370
- Cleve, R.¹

18
- 85030121757
- Equivalence between two flavours of oblivious transfers
- Springer-Verlag LNCS 293
- C. Crépeau. "Equivalence Between Two Flavours of Oblivious Transfers." Advances in Cryptology - Crypto '87 Proceedings, Springer-Verlag LNCS 293, 1988, 350-354.
- (1988) Advances in Cryptology - Crypto '87 Proceedings , pp. 350-354
- Crépeau, C.¹

19
- 85029211337
- Efficient cryptographic protocols based on noisy channels
- April 9
- C. Crépeau. "Efficient Cryptographic Protocols Based on Noisy Channels." Manuscript, April 9, 1996.
- (1996) Manuscript
- Crépeau, C.¹

20
- 0024132071
- Achieving oblivious transfer using weakened security assumptions
- IEEE
- th FOCS, IEEE, 1988, 42-52.
- (1988) th FOCS , pp. 42-52
- Crépeau, C.¹ Kitian, J.²

21
- 0027961556
- How to share a function securely
- ACM 1994
- th STOC, ACM, 1994, 1994, 522-533.
- (1994) th STOC , pp. 522-533
- DeSantis, A.¹ Desmedt, Y.² Frankel, Y.³ Yung, M.⁴

22
- 84976810569
- Reaching agreement in the presence of faults
- M. Pease, R. Shostak, L. Lamport. "Reaching Agreement in the Presence of Faults." JACM 27:2, 1980, 228-234.
- (1980) JACM , vol.27 , Issue.2 , pp. 228-234
- Pease, M.¹ Shostak, R.² Lamport, L.³

23
- 0022080529
- A randomized protocol for signing contracts
- S. Even, O. Goldreich, A. Lempel. "A Randomized Protocol for Signing Contracts." Comm. of the ACM 28:6, 1985, 637-647.
- (1985) Comm. of the ACM , vol.28 , Issue.6 , pp. 637-647
- Even, S.¹ Goldreich, O.² Lempel, A.³

24
- 0024135240
- Zero knowledge proofs of identity
- U. Feige, A. Fiat, A. Shamir. "Zero Knowledge Proofs of Identity." J. Cryptology 1:2, 1988, 77-94.
- (1988) J. Cryptology , vol.1 , Issue.2 , pp. 77-94
- Feige, U.¹ Fiat, A.² Shamir, A.³

25
- 0024611659
- The knowledge complexity of interactive proof systems
- S. Goldwasser, S. Micali, C. Rackoff. "The Knowledge Complexity of Interactive Proof Systems." SIAM J. on Computing 18:1, 1989, 186-208.
- (1989) SIAM J. on Computing , vol.18 , Issue.1 , pp. 186-208
- Goldwasser, S.¹ Micali, S.² Rackoff, C.³

26
- 0022914590
- Proofs that yield nothing but their validity and a methodology of cryptographic protocol design
- IEEE 1986
- th FOCS, IEEE, 1986, 1986, 174-187.
- (1986) th FOCS , pp. 174-187
- Goldreich, O.¹ Micali, S.² Wigderson, A.³

27
- 0023545076
- How to play any mental game, or A completeness theorem for protocols with honest majority
- ACM
- th STOC, ACM, 1987, 218-229.
- (1987) th STOC , pp. 218-229
- Goldreich, O.¹ Micali, S.² Wigderson, A.³

28
- 0001636850
- Kerberos: An authentication service for open network systems
- J. Steiner, B.C. Neumann, J. Schiller. "Kerberos: An Authentication Service for Open Network Systems." Usenix 1988 Conference Proceedings, 1988, 183-190.
- (1988) Usenix 1988 Conference Proceedings , pp. 183-190
- Steiner, J.¹ Neumann, B.C.² Schiller, J.³

29
- 84898989941
- Founding cryptography on oblivious transfer
- ACM, 1988
- th STOC, ACM, 1988, 1988, 20-29.
- (1988) th STOC , pp. 20-29
- Kilian, J.¹

30
- 0020271558
- Inferring a sequence generated by a linear congruence
- IEEE
- rd FOCS, IEEE, 1982, 153-159.
- (1982) rd FOCS , pp. 153-159
- Plumstead, J.¹

31
- 84974655726
- Secure computation
- Springer-Verlag LNCS 576
- S. Micali, P. Rogaway. "Secure Computation." Advances in Cryptology - Crypto '91 Proceedings, Springer-Verlag LNCS 576, 1992, 392-404.
- (1992) Advances in Cryptology - Crypto '91 Proceedings , pp. 392-404
- Micali, S.¹ Rogaway, P.²

32
- 0003462641
- TR-81, Harvard
- M.O. Rabin. "How to Exchange Secrets by Oblivious Transfer." TR-81, Harvard, 1981.
- (1981) How to Exchange Secrets by Oblivious Transfer
- Rabin, M.O.¹

33
- 0024859552
- Verifiable secret sharing and multiparty protocols with honest majority
- ACM
- st STOC, ACM, 1989, 73-85.
- (1989) st STOC , pp. 73-85
- Rabin, T.¹ Ben-Or, M.²

34
- 0016555241
- The protection of information in computer systems
- September
- J. Saltzer, M. Schroeder. "The Protection of Information in Computer Systems." Proc. IEEE 63:9, September 1975, 1278-130.
- (1975) Proc. IEEE , vol.63 , Issue.9 , pp. 1130-1278
- Saltzer, J.¹ Schroeder, M.²

35
- 0018545449
- How to share a secret
- A. Shamir. "How to Share a Secret." Communications of the ACM, 22,1979, 612-613.
- (1979) Communications of the ACM , vol.22 , pp. 612-613
- Shamir, A.¹

36
- 0023568495
- Random self-reducibility and zero-knowledge proofs of possession of information
- IEEE
- th FOCS, IEEE, 1987, 472-482.
- (1987) th FOCS , pp. 472-482
- Tompa, M.¹ Woll, H.²

37
- 0020312165
- Protocols for secure computations
- IEEE
- rd FOCS, IEEE, 1982, 160-164.
- (1982) rd FOCS , pp. 160-164
- Yao, A.¹

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