Practical Universal Random Sampling
暂无分享,去创建一个
[1] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[2] Cynthia Dwork,et al. Calibrating Noise to Sensitivity in Private Data Analysis , 2006, TCC.
[3] Svante Janson,et al. Random graphs , 2000, ZOR Methods Model. Oper. Res..
[4] Cynthia Dwork,et al. Advances in Cryptology – CRYPTO 2020: 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17–21, 2020, Proceedings, Part III , 2020, Annual International Cryptology Conference.
[5] Kamalika Chaudhuri,et al. When Random Sampling Preserves Privacy , 2006, CRYPTO.
[6] Yvo Desmedt,et al. Electronic Voting: Starting Over? , 2005, ISC.
[7] Svante Janson,et al. Random graphs , 2000, Wiley-Interscience series in discrete mathematics and optimization.
[8] A. Juels,et al. Universal Re-encryption for Mixnets , 2004, CT-RSA.
[9] A. Inkeles,et al. International Encyclopedia of the Social Sciences. , 1968 .
[10] Robin Milner,et al. On Observing Nondeterminism and Concurrency , 1980, ICALP.
[11] Stephen E. Fienberg,et al. Confidentiality and Data Protection Through Disclosure Limitation: Evolving Principles and Technical Advances , 2000 .
[12] Cynthia Dwork,et al. Differential Privacy: A Survey of Results , 2008, TAMC.
[13] Jonathan Katz,et al. Cryptographic Counters and Applications to Electronic Voting , 2001, EUROCRYPT.
[14] Irit Dinur,et al. Revealing information while preserving privacy , 2003, PODS.
[15] Cynthia Dwork,et al. Differential Privacy , 2006, ICALP.
[16] Eli Upfal,et al. Probability and Computing: Randomized Algorithms and Probabilistic Analysis , 2005 .
[17] Moni Naor,et al. On the complexity of differentially private data release: efficient algorithms and hardness results , 2009, STOC '09.
[18] Aaron Roth,et al. A learning theory approach to noninteractive database privacy , 2011, JACM.
[19] Cynthia Dwork,et al. The price of privacy and the limits of LP decoding , 2007, STOC '07.