SCOPUS 정보 검색 플랫폼

Proceedings of the Annual ACM Symposium on Theory of Computing

Volumn Part F129452, Issue , 1996, Pages 479-488

Correlated pseudorandomness and the complexity of private computations

(1) Beaver, Donald a

a Transarc Corp (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; INFORMATION THEORY; RANDOM PROCESSES; COMPUTATIONAL COMPLEXITY; CORRELATION METHODS; FUNCTIONS; POLYNOMIALS; PROBABILITY DENSITY FUNCTION; RANDOM NUMBER GENERATION; SECURITY OF DATA;

AMOUNT OF INFORMATION; COMPLEXITY HIERARCHIES; COMPUTABLE FUNCTIONS; CRYPTOGRAPHIC PRIMITIVES; DETERMINISTIC FUNCTIONS; PRIVATE COMPUTATION; PROBABILISTIC FUNCTIONS; TRAPDOOR PERMUTATIONS;

RANDOM NUMBER GENERATION; CRYPTOGRAPHY;

ARTIFICIAL ASYMMETRY; BLACKBOX ONE WAY PERMUTATION; CORRELATED PSEUDORANDOMNESS; MESSAGE COMPLEXITY; OBLIVIOUS TRANSFER;

EID: 0029702967 PISSN: 07378017 EISSN: None Source Type: Conference Proceeding
DOI: 10.1145/237814.237996 Document Type: Conference Paper

Times cited : (175)

References (31)

1
- 0027695921
- Privacy, additional information, and communication
- November, 1930-1943
- R. Bar-Yehuda, B. Chor, E. Kushilevitz, A. Orlitsky. "Privacy, Additional Information, and Communication. " IEEE Trans. Info. Theory 39:6, November 1993, 1930-1943.
- (1993) IEEE Trans. Info. Theory , vol.39 , pp. 6
- Bar-Yehuda, R.¹ Chor, B.² Kushilevitz, E.³ Orlitsky, A.⁴

2
- 84928743703
- Precomputing oblivious transfer
- Springer-Verlag LNCS
- 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 , vol.963 , pp. 97-109
- Beaver, D.¹

3
- 0003619771
- Perfect privacy for two-party protocols
- Princeton, NJ, October
- D. Beaver. "Perfect Privacy for Two-Party Protocols." Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography, Princeton, NJ, October 1989.
- (1989) Proceedings of the DIMACS Workshop on Distributed Computing and Cryptography
- Beaver, D.¹

4
- 0024769014
- Multiparty computation with faulty majority
- IEEE
- th FOCS, IEEE, 1989, 1989, 468-473.
- (1989) th FOCS , vol.1989 , pp. 468-473
- Beaver, D.¹ Goldwasser, S.²

5
- 33750715323
- Global, unpredictable bit generation without broadcast
- Springer-Verlag LNCS 765
- D. Beaver, N. So. "Global, Unpredictable Bit Generation Without Broadcast." Advances in Cryptology - Eurocrypt'93 Proceedings, Springer-Verlag LNCS 765, 1994, 424-434.
- (1994) Advances in Cryptology - Eurocrypt'93 Proceedings , pp. 424-434
- Beaver, D.¹ So, N.²

6
- 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.²

7
- 85028745601
- Another advantage of free choice
- ACM
- nd PODC, ACM, 1983.
- (1983) nd PODC
- Ben-Or, M.¹

8
- 0021522644
- How to generate cryptographically strong sequences of Pseudo-random bits
- M. Blum, S. Micali. "How to Generate Cryptographically Strong Sequences of Pseudo-Random Bits." SIAM J. on Computing 13, 1984, 850-864.
- (1984) SIAM J. on Computing , vol.13 , pp. 850-864
- Blum, M.¹ Micali, S.²

9
- 85032193074
- Zero-knowledge simulation of boolean circuits
- Springer-Verlag LNCS
- G. Brassard, C. Crepeau. "Zero-Knowledge Simulation of Boolean Circuits." Advances in Cryptology - Crypto'86 Proceedings, Springer-Verlag LNCS 263, 1987, 223-233.
- (1987) Advances in Cryptology - Crypto'86 Proceedings , vol.263 , pp. 223-233
- Brassard, G.¹ Crepeau, C.²

10
- 84888252697
- All or nothing disclosure of secrets
- Springer-Verlag LNCS
- G. Brassard, C. Crepeau, J. Robert. "All or Nothing Disclosure of Secrets." Advances in Cryptology - Crypto'86 Proceedings, Springer-Verlag LNCS 263, 1987, 234-238.
- (1987) Advances in Cryptology - Crypto'86 Proceedings , vol.263 , pp. 234-238
- Brassard, G.¹ Crepeau, C.² Robert, J.³

11
- 0022864717
- Information theoretic reductions among disclosure problems
- IEEE
- G. Brassard, C. Crépeau, J. Robert. "Information Theoretic Reductions Among Disclosure Problems." Proceedings of the 21th FOCS, IEEE, 1986, 1986, 168-173.
- (1986) Proceedings of the 21th FOCS , vol.1986 , pp. 168-173
- Brassard, G.¹ Crépeau, C.² Robert, J.³

12
- 0002738457
- A zero-one law for boolean privacy
- February
- B. Chor, E. Kushilevitz. "A Zero-One Law for Boolean Privacy." SIAM J. Disc. Math. 4:1, February 1991, 36-47.
- (1991) SIAM J. Disc. Math , vol.4 , Issue.1 , pp. 36-47
- Chor, B.¹ Kushilevitz, E.²

13
- 85030121757
- Equivalence between two flavours of oblivious transfers
- Springer-Verlag LNCS
- C. Crepeau. "Equivalence Between Two Flavours of Oblivious Transfers." Advances in Cryptology - Crypto'81 Proceedings, Springer-Verlag LNCS 293, 1988, 350-354.
- (1988) Advances in Cryptology - Crypto'81 Proceedings , vol.293 , pp. 350-354
- Crepeau, C.¹

14
- 33745969728
- Oblivious transfer protecting secrecy
- Springer-Verlag LNCS
- B. den Boer. "Oblivious Transfer Protecting Secrecy." Advances in Cryptology - Eurocrypt'91 Proceedings, Springer-Verlag LNCS 547, 1991, 31-45.
- (1991) Advances in Cryptology - Eurocrypt'91 Proceedings , vol.547 , pp. 31-45
- Den Boer, B.¹

15
- 0020878801
- A randomized protocol for signing contracts
- Springer-Verlag
- S. Even, O. Goldreich, A. Lempel. "A Randomized Protocol for Signing Contracts." Proceedings of Crypto 1982, Springer-Verlag, 1983, 205-210.
- (1983) Proceedings of Crypto 1982 , pp. 205-210
- Even, S.¹ Goldreich, O.² Lempel, A.³

16
- 84976655650
- Cryptographic computation: Secure fault-tolerant protocols and the public-key model
- Springer-Verlag LNCS
- Z. Galil, S. Haber, M. Yung. "Cryptographic Computation: Secure Fault-Tolerant Protocols and the Public-Key Model." Advances in Cryptology - Crypto'87 Proceedings, Springer-Verlag LNCS 293, 1988, 1988, 135-155.
- (1988) Advances in Cryptology - Crypto'87 Proceedings , vol.293 , pp. 135-155
- Galil, Z.¹ Haber, S.² Yung, M.³

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

18
- 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.³

19
- 85032194875
- How to solve any protocol problem - An efficiency improvement
- Springer-Verlag
- O. Goldreich, R. Vainish. "How to Solve any Protocol Problem - An Efficiency Improvement." Proceedings of Crypto 1987, Springer-Verlag, 1988, 73-86.
- (1988) Proceedings of Crypto 1987 , pp. 73-86
- Goldreich, O.¹ Vainish, R.²

20
- 33747194089
- Fair computation of general functions in presence of immoral majority
- S. Goldwasser, L. Levin. "Fair Computation of General Functions in Presence of Immoral Majority." Proceedings of Crypto 1990.
- (1990) Proceedings of Crypto
- Goldwasser, S.¹ Levin, L.²

21
- 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.³

22
- 0024866111
- Pseudo-random generation from one-way functions
- ACM
- st STOC, ACM, 1989, 1989, 12-24.
- (1989) st STOC , vol.1989 , pp. 12-24
- Impagliazzo, R.¹ Levin, L.² Luby, M.³

23
- 0024866742
- Limits on the provable consequences of one-way permutations
- ACM
- st STOC, ACM, 1989, 1989, 44-62.
- (1989) st STOC , vol.1989 , pp. 44-62
- Impagliazzo, R.¹ Rudich, S.²

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

25
- 4544353942
- A general completeness theorem for two-party games
- ACM
- rd STOC, ACM, 1991, 553-560.
- (1991) rd STOC , pp. 553-560
- Kilian, J.¹

26
- 0024769470
- Minimum resource zero-knowledge proofs
- IEEE
- th FOCS, IEEE, 1989, 1989, 474-479.
- (1989) th FOCS , vol.1989 , pp. 474-479
- Kilian, J.¹ Micali, S.² Ostrovsky, R.³

27
- 0002365530
- Privacy and communication complexity
- May
- E. Kushilevitz. "Privacy and Communication Complexity", SIAM J. Disc. Math. 5:2, May 1992, 273-284.
- (1992) SIAM J. Disc. Math , vol.5 , Issue.2 , pp. 273-284
- Kushilevitz, E.¹

28
- 84968329589
- Reducibility and completeness in multi-party private computations
- IEEE
- th FOCS, IEEE, 1994, 478-489.
- (1994) th FOCS , pp. 478-489
- Kushilevitz, E.¹ Micali, S.² Ostrovsky, R.³

29
- 34748844513
- Fair games against an all-powerful adversary
- R. Ostrovsky, R. Venkatesan, M. Yung. "Fair Games Against an All-Powerful Adversary." SEQUENCES'91, 1991.
- (1991) SEQUENCES'91
- Ostrovsky, R.¹ Venkatesan, R.² Yung, M.³

30
- 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.¹

31
- 0022882770
- How to generate and exchange secrets
- IEEE
- th FOCS, IEEE, 1986, 1986, 162-167.
- (1986) th FOCS , vol.1986 , pp. 162-167
- Yao, A.¹

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