Kobbi Nissim

International Association for Cryptologic Research

Kobbi Nissim Search web for home page

1	2009	TCC	pc
2	2006	Crypto	pc

	year	title	booktitle	pages
1	2010	Bounds on the Sample Complexity for Private Learning and Private Data Release	tcc	437-454
2	2010	Efficient Set Operations in the Presence of Malicious Adversaries	pkc	312-331
3	2010	How Should We Solve Search Problems Privately?	jofc	344-371
4	2008	Distributed Private Data Analysis: Simultaneously Solving How and What	crypto	451-468
5	2007	Private Approximation of Clustering and Vertex Cover	tcc	383-403
6	2007	How Should We Solve Search Problems Privately?	crypto	31-49
7	2006	Communication Efficient Secure Linear Algebra	tcc	online
8	2006	Calibrating Noise to Sensitivity in Private Data Analysis	tcc	online
9	2006	Hard Instances of the Constrained Discrete Logarithm Problem	eprint	online
10	2005	Evaluating 2-DNF Formulas on Ciphertexts	tcc	online
11	2004	Efficient Private Matching and Set Intersection	eurocrypt	online
12	2004	Privacy-Preserving Datamining on Vertically Partitioned Databases	crypto	online
13	2003	Extending Oblivious Transfers Efficiently	crypto	online
14	2001	Secure Multiparty Computation of Approximations	eprint	online
15	2001	Communication Complexity and Secure Function Evaluation	eprint	online
16	1999	Efficient Communication-Storage Tradeoffs for Multicast Encryption	eurocrypt	459-474