-
1
-
-
33746028196
-
Perfect privacy for two-party protocols
-
Feigenbaum, J., Merritt, M. (eds.) American Mathematical Society
-
Beaver, D.: Perfect privacy for two-party protocols. In: Feigenbaum, J., Merritt, M. (eds.) Proceedings of DIMACS Workshop on Distributed Computing and Cryptology, vol. 2, pp. 65-77. American Mathematical Society (1989)
-
(1989)
Proceedings of DIMACS Workshop on Distributed Computing and Cryptology
, vol.2
, pp. 65-77
-
-
Beaver, D.1
-
2
-
-
84884473317
-
-
Wagner (ed.) [29]
-
Beimel, A., Nissim, K., Omri, E.: Distributed private data analysis: Simultaneously solving how and what. In: Wagner (ed.) [29], pp. 451-468
-
Distributed Private Data Analysis: Simultaneously Solving How and What
, pp. 451-468
-
-
Beimel, A.1
Nissim, K.2
Omri, E.3
-
3
-
-
84884811214
-
-
extended abstract. Simon (ed.) [28]
-
Ben-Or, M., Goldwasser, S., Wigderson, A.: Completeness theorems for non-cryptographic fault-tolerant distributed computation (extended abstract). In: Simon (ed.) [28], pp. 1-10
-
Completeness Theorems for Non-cryptographic Fault-tolerant Distributed Computation
, pp. 1-10
-
-
Ben-Or, M.1
Goldwasser, S.2
Wigderson, A.3
-
4
-
-
35248854495
-
On the limitations of universally composable two-party computation without set-up assumptions
-
Biham, E. (ed.) EUROCRYPT 2003. Springer, Heidelberg
-
Canetti, R., Kushilevitz, E., Lindell, Y.: On the limitations of universally composable two-party computation without set-up assumptions. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 68-86. Springer, Heidelberg (2003)
-
(2003)
LNCS
, vol.2656
, pp. 68-86
-
-
Canetti, R.1
Kushilevitz, E.2
Lindell, Y.3
-
5
-
-
84866647559
-
Optimal lower bound for differentially private multi-party aggregation
-
Epstein, L., Ferragina, P. (eds.) ESA 2012. Springer, Heidelberg
-
Chan, T.-H.H., Shi, E., Song, D.: Optimal lower bound for differentially private multi-party aggregation. In: Epstein, L., Ferragina, P. (eds.) ESA 2012. LNCS, vol. 7501, pp. 277-288. Springer, Heidelberg (2012)
-
(2012)
LNCS
, vol.7501
, pp. 277-288
-
-
Chan, T.-H.H.1
Shi, E.2
Song, D.3
-
6
-
-
84898947315
-
Multiparty unconditionally secure protocols
-
ACM, New York
-
Chaum, D., Crépeau, C., Damgard, I.: Multiparty unconditionally secure protocols. In: Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988, pp. 11-19. ACM, New York (1988), http://doi.acm.org/10.1145/62212.62214
-
(1988)
Proceedings of the Twentieth Annual ACM Symposium on Theory of Computing, STOC 1988
, pp. 11-19
-
-
Chaum, D.1
Crépeau, C.2
Damgard, I.3
-
7
-
-
0002738457
-
A zero-one law for Boolean privacy
-
Chor, B., Kushilevitz, E.: A zero-one law for Boolean privacy. SIAM J. Discrete Math. 4(1), 36-47 (1991)
-
(1991)
SIAM J. Discrete Math.
, vol.4
, Issue.1
, pp. 36-47
-
-
Chor, B.1
Kushilevitz, E.2
-
8
-
-
84858307870
-
Lower bounds in differential privacy
-
Cramer, R. (ed.) TCC 2012. Springer, Heidelberg
-
De, A.: Lower bounds in differential privacy. In: Cramer, R. (ed.) TCC 2012. LNCS, vol. 7194, pp. 321-338. Springer, Heidelberg (2012)
-
(2012)
LNCS
, vol.7194
, pp. 321-338
-
-
De, A.1
-
9
-
-
1142275486
-
Revealing information while preserving privacy
-
ACM
-
Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: PODS, pp. 202-210. ACM (2003)
-
(2003)
PODS
, pp. 202-210
-
-
Dinur, I.1
Nissim, K.2
-
10
-
-
33746335051
-
Differential privacy
-
Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. Part II, Springer, Heidelberg
-
Dwork, C.: Differential privacy. In: Bugliesi, M., Preneel, B., Sassone, V., Wegener, I. (eds.) ICALP 2006. Part II, LNCS, vol. 4052, pp. 1-12. Springer, Heidelberg (2006)
-
(2006)
LNCS
, vol.4052
, pp. 1-12
-
-
Dwork, C.1
-
11
-
-
33746037200
-
Our data, ourselves: Privacy via distributed noise generation
-
DOI 10.1007/11761679-29, Advances in Cryptology - EUROCRYPT 2006 - 24th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings
-
Dwork, C., Kenthapadi, K., McSherry, F., Mironov, I., Naor, M.: Our data, ourselves: Privacy via distributed noise generation. In: Vaudenay, S. (ed.) EUROCRYPT 2006. LNCS, vol. 4004, pp. 486-503. Springer, Heidelberg (2006) (Pubitemid 44072257)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.4004 LNCS
, pp. 486-503
-
-
Dwork, C.1
Kenthapadi, K.2
McSherry, F.3
Mironov, I.4
Naor, M.5
-
12
-
-
33745556605
-
Calibrating noise to sensitivity in private data analysis
-
DOI 10.1007/11681878-14, Theory of Cryptography: Third Theory of Cryptography Conference, TCC 2006, Proceedings
-
Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Halevi, S., Rabin, T. (eds.) TCC 2006. LNCS, vol. 3876, pp. 265-284. Springer, Heidelberg (2006) (Pubitemid 43979853)
-
(2006)
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
, vol.3876 LNCS
, pp. 265-284
-
-
Dwork, C.1
McSherry, F.2
Nissim, K.3
Smith, A.4
-
13
-
-
35048856104
-
Privacy-preserving datamining on vertically partitioned databases
-
Franklin, M. (ed.) CRYPTO 2004. Springer, Heidelberg
-
Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 528-544. Springer, Heidelberg (2004)
-
(2004)
LNCS
, vol.3152
, pp. 528-544
-
-
Dwork, C.1
Nissim, K.2
-
14
-
-
70350683770
-
Universally utility-maximizing privacy mechanisms
-
Mitzenmacher, M. (ed.) ACM
-
Ghosh, A., Roughgarden, T., Sundararajan, M.: Universally utility-maximizing privacy mechanisms. In: Mitzenmacher, M. (ed.) Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, pp. 351-360. ACM (2009)
-
(2009)
Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009
, pp. 351-360
-
-
Ghosh, A.1
Roughgarden, T.2
Sundararajan, M.3
-
15
-
-
0023545076
-
COMPLETENESS THEOREM FOR PROTOCOLS WITH HONEST MAJORITY
-
Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or a completeness theorem for protocols with honest majority. In: Aho, A.V. (ed.) STOC, pp. 218-229. ACM (1987) (Pubitemid 18643409)
-
(1987)
Conference Proceedings of the Annual ACM Symposium on Theory of Computing
, pp. 218-229
-
-
Goldreich, O.1
Micali, S.2
Wigderson, A.3
-
16
-
-
84884467129
-
On the power of random oracles
-
Haitner, I., Omri, E., Zarosim, H.: On the power of random oracles. IACR Cryptology ePrint Archive 2012, 573 (2012)
-
(2012)
IACR Cryptology ePrint Archive 2012
, vol.573
-
-
Haitner, I.1
Omri, E.2
Zarosim, H.3
-
18
-
-
33749559395
-
Completeness in two-party secure computation: A computational view
-
Harnik, D., Naor, M., Reingold, O., Rosen, A.: Completeness in two-party secure computation: A computational view. J. Cryptology 19(4), 521-552 (2006)
-
(2006)
J. Cryptology
, vol.19
, Issue.4
, pp. 521-552
-
-
Harnik, D.1
Naor, M.2
Reingold, O.3
Rosen, A.4
-
19
-
-
84884486562
-
-
Wagner (ed.) [29]
-
Ishai, Y., Prabhakaran, M., Sahai, A.: Founding cryptography on oblivious transfer-efficiently. In: Wagner (ed.) [29], pp. 572-591
-
Founding Cryptography on Oblivious Transfer-efficiently
, pp. 572-591
-
-
Ishai, Y.1
Prabhakaran, M.2
Sahai, A.3
-
20
-
-
84884495780
-
-
Schulman (ed.) [27]
-
Kasiviswanathan, S.P., Rudelson, M., Smith, A., Ullman, J.: The price of privately releasing contingency tables and the spectra of random matrices with correlated rows. In: Schulman (ed.) [27], pp. 775-784
-
The Price of Privately Releasing Contingency Tables and the Spectra of Random Matrices with Correlated Rows
, pp. 775-784
-
-
Kasiviswanathan, S.P.1
Rudelson, M.2
Smith, A.3
Ullman, J.4
-
22
-
-
4544353942
-
A general completeness theorem for two-party games
-
Koutsougeras, C., Vitter, J.S. (eds.) ACM
-
Kilian, J.: A general completeness theorem for two-party games. In: Koutsougeras, C., Vitter, J.S. (eds.) STOC, pp. 553-560. ACM (1991)
-
(1991)
STOC
, pp. 553-560
-
-
Kilian, J.1
-
23
-
-
0033706604
-
More general completeness theorems for secure two-party computation
-
Kilian, J.: More general completeness theorems for secure two-party computation. In: STOC, pp. 316-324 (2000)
-
(2000)
STOC
, pp. 316-324
-
-
Kilian, J.1
-
24
-
-
0024768184
-
Privacy and communication complexity
-
Kushilevitz, E.: Privacy and communication complexity. In: FOCS, pp. 416-421 (1989)
-
(1989)
FOCS
, pp. 416-421
-
-
Kushilevitz, E.1
-
25
-
-
78751557330
-
The limits of two-party differential privacy
-
IEEE Computer Society
-
McGregor, A., Mironov, I., Pitassi, T., Reingold, O., Talwar, K., Vadhan, S.P.: The limits of two-party differential privacy. In: FOCS, pp. 81-90. IEEE Computer Society (2010)
-
(2010)
FOCS
, pp. 81-90
-
-
McGregor, A.1
Mironov, I.2
Pitassi, T.3
Reingold, O.4
Talwar, K.5
Vadhan, S.P.6
-
26
-
-
70350338483
-
Computational differential privacy
-
Halevi, S. (ed.) CRYPTO 2009. Springer, Heidelberg
-
Mironov, I., Pandey, O., Reingold, O., Vadhan, S.: Computational differential privacy. In: Halevi, S. (ed.) CRYPTO 2009. LNCS, vol. 5677, pp. 126-142. Springer, Heidelberg (2009)
-
(2009)
LNCS
, vol.5677
, pp. 126-142
-
-
Mironov, I.1
Pandey, O.2
Reingold, O.3
Vadhan, S.4
-
27
-
-
84884476285
-
-
ACM
-
Schulman, L.J. (ed.): Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, June 5-8. ACM (2010)
-
(2010)
Proceedings of the 42nd ACM Symposium on Theory of Computing, STOC 2010, Cambridge, Massachusetts, USA, June 5-8
-
-
Schulman, L.J.1
-
28
-
-
84884482386
-
-
ACM
-
Simon, J. (ed.): Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2-4. ACM (1988)
-
(1988)
Proceedings of the 20th Annual ACM Symposium on Theory of Computing, Chicago, Illinois, USA, May 2-4
-
-
Simon, J.1
-
29
-
-
84884476279
-
-
CRYPTO 2008. Springer, Heidelberg
-
Wagner, D. (ed.): CRYPTO 2008. LNCS, vol. 5157. Springer, Heidelberg (2008)
-
(2008)
LNCS
, vol.5157
-
-
Wagner, D.1
|