-
1
-
-
0017930809
-
A method for obtaining digital signatures and public-key cryptosystem
-
Feb.
-
R. Rivest, A. Shamir, and L. Adleman, "A method for obtaining digital signatures and public-key cryptosystem," Communications of the ACM, vol. 21, no. 2, pp. 120-126, Feb. 1978.
-
(1978)
Communications of the ACM
, vol.21
, Issue.2
, pp. 120-126
-
-
Rivest, R.1
Shamir, A.2
Adleman, L.3
-
2
-
-
10644270917
-
Secrecy capacities for multiple terminals
-
Dec.
-
I. Csiszár and P. Narayan, "Secrecy capacities for multiple terminals," IEEE Trans. Inform. Theory, vol. 50, no. 12, pp. 3047-3061, Dec. 2004.
-
(2004)
IEEE Trans. Inform. Theory
, vol.50
, Issue.12
, pp. 3047-3061
-
-
Csiszár, I.1
Narayan, P.2
-
3
-
-
0016562514
-
The wire-tap channel
-
A. D. Wyner, "The wire-tap channel," Bell Sys. Tech. J., vol. 54, pp. 1355-1387, 1975.
-
(1975)
Bell Sys. Tech. J.
, vol.54
, pp. 1355-1387
-
-
Wyner, A.D.1
-
4
-
-
24144487020
-
Towards privacy in public databases
-
S. Chawla, C. Dwork, F. McSherry, A. Smith, and H. Wee, "Towards privacy in public databases," in Proc. 2nd IACR Theory Crypto. Conf., Cambridge, MA, Feb. 2005, pp. 363-385.
-
Proc. 2nd IACR Theory Crypto. Conf., Cambridge, MA, Feb. 2005
, pp. 363-385
-
-
Chawla, S.1
Dwork, C.2
McSherry, F.3
Smith, A.4
Wee, H.5
-
5
-
-
0024914229
-
Security-control methods for statistical databases: A comparative study
-
N. R. Adam and J. C. Wortmann, "Security-control methods for statistical databases: A comparative study," ACM Computing Surveys, vol. 21, no. 4, pp. 515-556, 1989.
-
(1989)
ACM Computing Surveys
, vol.21
, Issue.4
, pp. 515-556
-
-
Adam, N.R.1
Wortmann, J.C.2
-
6
-
-
0000072558
-
Finding a needle in a haystack - Or identifying anonymous census records
-
T. Dalenius, "Finding a needle in a haystack - or identifying anonymous census records," Jour. Official Stats., vol. 2, no. 3, pp. 329-336, 1986.
-
(1986)
Jour. Official Stats.
, vol.2
, Issue.3
, pp. 329-336
-
-
Dalenius, T.1
-
7
-
-
0036811662
-
K-anonymity: A model for protecting privacy
-
L. Sweeney, "k-anonymity: A model for protecting privacy," IEEE Trans. Inform. Theory, vol. 10, no. 5, pp. 557-570, 2002.
-
(2002)
IEEE Trans. Inform. Theory
, vol.10
, Issue.5
, pp. 557-570
-
-
Sweeney, L.1
-
8
-
-
0034827009
-
On the design and quantification of privacy preserving data mining algorithms
-
D. Agrawal and C. Aggarwal, "On the design and quantification of privacy preserving data mining algorithms," in Proc. 20th Symp. Principles of Database Systems, Santa Barbara, CA, May 2001.
-
Proc. 20th Symp. Principles of Database Systems, Santa Barbara, CA, May 2001
-
-
Agrawal, D.1
Aggarwal, C.2
-
9
-
-
50249086141
-
Differential privacy
-
C. Dwork, "Differential privacy," in Proc. 33rd Intl. Colloq. Automata, Lang., Prog., Venice, Italy, July 2006.
-
Proc. 33rd Intl. Colloq. Automata, Lang., Prog., Venice, Italy, July 2006
-
-
Dwork, C.1
-
11
-
-
0020843592
-
A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers
-
Nov.
-
H. Yamamoto, "A source coding problem for sources with additional outputs to keep secret from the receiver or wiretappers," IEEE Trans. Inform. Theory, vol. 29, no. 6, pp. 918-923, Nov. 1983.
-
(1983)
IEEE Trans. Inform. Theory
, vol.29
, Issue.6
, pp. 918-923
-
-
Yamamoto, H.1
-
12
-
-
0031644241
-
Approximate nearest neighbor: Towards removing the curse of dimensionality
-
P. Indyk and R. Motwani, "Approximate nearest neighbor: towards removing the curse of dimensionality," in Proc. 30th Annual ACM Symp. Theory of Computing, Dallas, TX, May 1998, pp. 604-613.
-
Proc. 30th Annual ACM Symp. Theory of Computing, Dallas, TX, May 1998
, pp. 604-613
-
-
Indyk, P.1
Motwani, R.2
-
13
-
-
2942650789
-
Rate-distortion approach to databases: Storage and content retrieval
-
June
-
E. Tuncel, P. Koulgi, and K. Rose, "Rate-distortion approach to databases: Storage and content retrieval," IEEE Trans. Inform. Theory, vol. 50, no. 6, pp. 953-967, June 2004.
-
(2004)
IEEE Trans. Inform. Theory
, vol.50
, Issue.6
, pp. 953-967
-
-
Tuncel, E.1
Koulgi, P.2
Rose, K.3
-
15
-
-
0003214704
-
Coding theorems for a discrete source with a fidelity criterion
-
C. E. Shannon, "Coding theorems for a discrete source with a fidelity criterion," IRE Nat. Conv. Record, vol. 7, pp. 325-350, 1959.
-
(1959)
IRE Nat. Conv. Record
, vol.7
, pp. 325-350
-
-
Shannon, C.E.1
-
16
-
-
0016882596
-
The rate-distortion function for source coding with side information at the decoder
-
Jan.
-
A. D. Wyner and J. Ziv, "The rate-distortion function for source coding with side information at the decoder," IEEE Trans. Inform. Theory, vol. 22, no. 1, pp. 1-10, Jan. 1976.
-
(1976)
IEEE Trans. Inform. Theory
, vol.22
, Issue.1
, pp. 1-10
-
-
Wyner, A.D.1
Ziv, J.2
-
17
-
-
1142275486
-
Revealing information while preserving privacy
-
I. Dinur and K. Nissim, "Revealing information while preserving privacy," in Proc. Symp. Principles of Database Systems, San Diego, CA, June 2003.
-
Proc. Symp. Principles of Database Systems, San Diego, CA, June 2003
-
-
Dinur, I.1
Nissim, K.2
-
18
-
-
33746086554
-
Calibrating noise to sensitivity in private data analysis
-
C. Dwork, F. McSherry, K. Nissim, and A. Smith, "Calibrating noise to sensitivity in private data analysis," in Proc. 3rd IACR Theory Crypto. Conf., New York, NY, Mar. 2006.
-
Proc. 3rd IACR Theory Crypto. Conf., New York, NY, Mar. 2006
-
-
Dwork, C.1
McSherry, F.2
Nissim, K.3
Smith, A.4
-
20
-
-
0026120037
-
Successive refinement of information
-
Mar.
-
W. Equitz and T. Cover, "Successive refinement of information," IEEE Trans. Inform. Theory, vol. 37, no. 2, pp. 269-275, Mar. 1991.
-
(1991)
IEEE Trans. Inform. Theory
, vol.37
, Issue.2
, pp. 269-275
-
-
Equitz, W.1
Cover, T.2
-
21
-
-
0028261357
-
Successive refinement of information: Characterization of the achievable rates
-
Jan.
-
B. Rimoldi, "Successive refinement of information: Characterization of the achievable rates," IEEE Trans. Inform. Theory, vol. 40, no. 1, pp. 253-259, Jan. 1994.
-
(1994)
IEEE Trans. Inform. Theory
, vol.40
, Issue.1
, pp. 253-259
-
-
Rimoldi, B.1
-
22
-
-
77952727585
-
The rate-distortion region for multiple descriptions without excess rate
-
R. Ahlswede, "The rate-distortion region for multiple descriptions without excess rate," IEEE J. Uncert. Fuzz. and Knowledge-based Sys., vol. 10, no. 5, pp. 557-570, 2002.
-
(2002)
IEEE J. Uncert. Fuzz. and Knowledge-based Sys.
, vol.10
, Issue.5
, pp. 557-570
-
-
Ahlswede, R.1
|