{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T05:24:06Z","timestamp":1776317046391,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540345466","type":"print"},{"value":"9783540345473","type":"electronic"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11761679_29","type":"book-chapter","created":{"date-parts":[[2006,7,4]],"date-time":"2006-07-04T14:11:19Z","timestamp":1152022279000},"page":"486-503","source":"Crossref","is-referenced-by-count":965,"title":["Our Data, Ourselves: Privacy Via Distributed Noise Generation"],"prefix":"10.1007","author":[{"given":"Cynthia","family":"Dwork","sequence":"first","affiliation":[]},{"given":"Krishnaram","family":"Kenthapadi","sequence":"additional","affiliation":[]},{"given":"Frank","family":"McSherry","sequence":"additional","affiliation":[]},{"given":"Ilya","family":"Mironov","sequence":"additional","affiliation":[]},{"given":"Moni","family":"Naor","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"29_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, D., Aggarwal, C.: On the design and quantification of privacy preserving data mining algorithms. In: Proceedings of the 20th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 247\u2013255 (2001)","DOI":"10.1145\/375551.375602"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Srikant, R.: Privacy-preserving data mining. In: Proceedings of the ACM SIGMOD International Conference on Management of Data, pp. 439\u2013450 (May 2000)","DOI":"10.1145\/335191.335438"},{"key":"29_CR3","doi-asserted-by":"crossref","unstructured":"Bellare, M., Garay, J.A., Rabin, T.: Distributed pseudo-random bit generators\u2014a new way to speed-up shared coin tossing. In: Proceedings of the 15th ACM Symposium on Principles of Distributed Computing, pp. 191\u2013200 (1996)","DOI":"10.1145\/248052.248090"},{"key":"29_CR4","doi-asserted-by":"crossref","unstructured":"Blum, A., Dwork, C., McSherry, F., Nissim, K.: Practical privacy: The SuLQ framework. In: Proceedings of the 24th ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 128\u2013138 (June 2005)","DOI":"10.1145\/1065167.1065184"},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Chawla, S., Dwork, C., McSherry, F., Smith, A., Wee, H.: Toward privacy in public databases. In: Proceedings of the 2nd Theory of Cryptography Conference, pp. 363\u2013385 (2005)","DOI":"10.1007\/978-3-540-30576-7_20"},{"key":"29_CR6","unstructured":"Chawla, S., Dwork, C., McSherry, F., Talwar, K.: On the utility of privacy-preserving histograms. In: Proceedings of the 21st Conference on Uncertainty in Artificial Intelligence (2005)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldreich, O., H\u00e5stad, J., Friedman, J., Rudich, S., Smolensky, R.: The bit extraction problem of t-resilient functions. In: Proceedings of the 26th IEEE Symposium on Foundations of Computer Science, pp. 429\u2013442 (1985)","DOI":"10.1109\/SFCS.1985.55"},{"key":"29_CR8","doi-asserted-by":"crossref","unstructured":"Chor, B., Goldwasser, S., Micali, S., Awerbuch, B.: Verifiable secret sharing and achieving simultaneity in the presence of faults. In: Proceedings of the 26th Annual IEEE Symposium on Foundations of Computer Science, pp. 383\u2013395 (1985)","DOI":"10.1109\/SFCS.1985.64"},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Cohen, A., Wigderson, A.: Dispersers, deterministic amplification, and weak random sources. In: Proceedings of the 30th Annual IEEE Symposium on Foundations of Computer Science, pp. 14\u201319 (1989)","DOI":"10.1109\/SFCS.1989.63449"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Damg\u00e5rd, I., Fitzi, M., Kiltz, E., Nielsen, J.B., Toft, T.: Unconditionally secure constant-rounds multi-party computation for equality, comparison, bits and exponentiation. In: Proceedings of the 3rd Theory of Cryptography Conference, pp. 285\u2013304 (2006)","DOI":"10.1007\/11681878_15"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Dinur, I., Nissim, K.: Revealing information while preserving privacy. In: Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 202\u2013210 (2003)","DOI":"10.1145\/773153.773173"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Dwork, C., Lotspiech, J., Naor, M.: Digital signets for protection of digital information. In: Proceedings of the 28th annual ACM symposium on Theory of computing, pp. 489\u2013498 (1996)","DOI":"10.1145\/237814.237997"},{"key":"29_CR13","doi-asserted-by":"crossref","unstructured":"Dwork, C., McSherry, F., Nissim, K., Smith, A.: Calibrating noise to sensitivity in private data analysis. In: Proceedings of the 3rd Theory of Cryptography Conference, pp. 265\u2013284 (2006)","DOI":"10.1007\/11681878_14"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Dwork, C., Nissim, K.: Privacy-preserving datamining on vertically partitioned databases. In: Advances in Cryptology: Proceedings of Crypto., pp. 528\u2013544 (2004)","DOI":"10.1007\/978-3-540-28628-8_32"},{"key":"29_CR15","doi-asserted-by":"crossref","unstructured":"Evfimievski, A., Gehrke, J., Srikant, R.: Limiting privacy breaches in privacy preserving data mining. In: Proceedings of the 22nd ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems, pp. 211\u2013222 (June 2003)","DOI":"10.1145\/773153.773174"},{"key":"29_CR16","doi-asserted-by":"crossref","unstructured":"Gabizon, A., Raz, R., Shaltiel, R.: Deterministic extractors for bit-fixing sources by obtaining an independent seed. In: Proceedings of the 45th IEEE Symposium on Foundations of Computer Science, pp. 394\u2013403 (2004)","DOI":"10.1109\/FOCS.2004.21"},{"key":"29_CR17","doi-asserted-by":"crossref","unstructured":"Goldreich, O., Micali, S., Wigderson, A.: How to play any mental game or A completeness theorem for protocols with honest majority. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing, pp. 218\u2013229 (1987)","DOI":"10.1145\/28395.28420"},{"key":"29_CR18","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511721656","volume-title":"Foundations of Cryptography - Basic Applications","author":"O. Goldreich","year":"2004","unstructured":"Goldreich, O.: Foundations of Cryptography - Basic Applications, vol. 2. Cambridge University Press, Cambridge (2004)"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"Kamp, J., Zuckerman, D.: Deterministic extractors for bit-fixing sources and exposure-resilient cryptography. In: Proceedings of the 44th Annual IEEE Symposium on Foundations of Computer Science, pp. 92\u2013101 (2003)","DOI":"10.1109\/SFCS.2003.1238184"},{"issue":"3","key":"29_CR20","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1145\/357172.357176","volume":"4","author":"L. Lamport","year":"1982","unstructured":"Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems\u00a04(3), 382\u2013401 (1982)","journal-title":"ACM Transactions on Programming Languages and Systems"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1006\/jcss.1996.0004","volume":"52","author":"N. Nisan","year":"1996","unstructured":"Nisan, N., Zuckerman, D.: Randomness is linear in space. J. Comput. Syst. Sci.\u00a052(1), 43\u201352 (1996)","journal-title":"J. Comput. Syst. Sci."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Rabin, M.O.: Randomized Byzantine generals. In: Proceedings of the 24th IEEE Symposium on Foundations of Computer Science, pp. 403\u2013409 (1983)","DOI":"10.1109\/SFCS.1983.48"},{"key":"29_CR23","first-page":"67","volume":"77","author":"R. Shaltiel","year":"2002","unstructured":"Shaltiel, R.: Recent developments in explicit constructions of extractors. Bulletin of the EATCS\u00a077, 67\u201395 (2002)","journal-title":"Bulletin of the EATCS"},{"key":"29_CR24","doi-asserted-by":"crossref","unstructured":"Trevisan, L., Vadhan, S.: Extracting randomness from samplable distributions. In: Proceedings of the 41st Annual IEEE Symposium on Foundations of Computer Science, pp. 32\u201342 (2000)","DOI":"10.1109\/SFCS.2000.892063"},{"key":"29_CR25","doi-asserted-by":"crossref","unstructured":"Yao, A.: Protocols for secure computations (extended abstract). In: Proceedings of the 23rd IEEE Symposium on Foundations of Computer Science, pp. 160\u2013164 (1982)","DOI":"10.1109\/SFCS.1982.38"}],"container-title":["Lecture Notes in Computer Science","Advances in Cryptology - EUROCRYPT 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11761679_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,19]],"date-time":"2019-04-19T19:49:55Z","timestamp":1555703395000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11761679_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540345466","9783540345473"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11761679_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2006]]}}}