Add private couplings draft.
This commit is contained in:
parent
81bad8e2de
commit
00f0ac70f7
|
@ -308,9 +308,11 @@
|
||||||
@STRING{stoc12 = stoc # ", New York, New York"}
|
@STRING{stoc12 = stoc # ", New York, New York"}
|
||||||
@STRING{stoc13 = stoc # ", Palo Alto, California"}
|
@STRING{stoc13 = stoc # ", Palo Alto, California"}
|
||||||
@STRING{stoc14 = stoc # ", New York, New York"}
|
@STRING{stoc14 = stoc # ", New York, New York"}
|
||||||
|
@STRING{stoc15 = stoc # ", Portland, Oregon"}
|
||||||
|
|
||||||
% ----
|
% ----
|
||||||
@STRING{focs = "{IEEE} {S}ymposium on {F}oundations of {C}omputer {S}cience (FOCS)"}
|
@STRING{focs = "{IEEE} {S}ymposium on {F}oundations of {C}omputer {S}cience (FOCS)"}
|
||||||
|
@STRING{focs79 = focs # ", San Juan, Puerto Rico"}
|
||||||
@STRING{focs82 = focs # ", Chicago, Illinois"}
|
@STRING{focs82 = focs # ", Chicago, Illinois"}
|
||||||
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
|
@STRING{focs05 = focs # ", Pittsburgh, Pennsylvania"}
|
||||||
@STRING{focs07 = focs # ", Providence, Rhode Island"}
|
@STRING{focs07 = focs # ", Providence, Rhode Island"}
|
||||||
|
@ -534,6 +536,10 @@
|
||||||
@STRING{aplas05 = aplas # ", Tsukuba, Japan" }
|
@STRING{aplas05 = aplas # ", Tsukuba, Japan" }
|
||||||
@STRING{aplas10 = aplas # ", Shanghai, China" }
|
@STRING{aplas10 = aplas # ", Shanghai, China" }
|
||||||
%----
|
%----
|
||||||
|
@STRING{ascrypt = "International Conference on the Theory and
|
||||||
|
Application of Cryptology and Information Security (ASIACRYPT)" }
|
||||||
|
@STRING{ascrypt15 = ascrypt # ", Auckland, New Zealand" }
|
||||||
|
%----
|
||||||
@STRING{asplos14 = aplas # ", Salt Lake City, Utah" }
|
@STRING{asplos14 = aplas # ", Salt Lake City, Utah" }
|
||||||
%----
|
%----
|
||||||
@STRING{ceemas07 = ceemas # ", Leipzig, Germany" }
|
@STRING{ceemas07 = ceemas # ", Leipzig, Germany" }
|
||||||
|
@ -555,6 +561,8 @@
|
||||||
@STRING{cp03 = cp # ", Kinsale, Ireland" }
|
@STRING{cp03 = cp # ", Kinsale, Ireland" }
|
||||||
% ---
|
% ---
|
||||||
@STRING{crypto = "{IACR} International Cryptology Conference {(CRYPTO)}"}
|
@STRING{crypto = "{IACR} International Cryptology Conference {(CRYPTO)}"}
|
||||||
|
@STRING{crypto02 = crypto # ", Santa Barbara, California"}
|
||||||
|
@STRING{crypto10 = crypto # ", Santa Barbara, California"}
|
||||||
@STRING{crypto11 = crypto # ", Santa Barbara, California"}
|
@STRING{crypto11 = crypto # ", Santa Barbara, California"}
|
||||||
% ---
|
% ---
|
||||||
@STRING{csl94 = csl # ", Kazimierz, Poland" }
|
@STRING{csl94 = csl # ", Kazimierz, Poland" }
|
||||||
|
|
133
bibs/myrefs.bib
133
bibs/myrefs.bib
|
@ -1,4 +1,17 @@
|
||||||
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
%%%%%%%%%%%%%%%%%%%%%%%%%%%% UNPUBLISHED %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
|
||||||
|
@unpublished{BGGHS16,
|
||||||
|
title = {Proving Differential Privacy via Probabilistic Couplings},
|
||||||
|
author = {Barthe, Gilles and
|
||||||
|
Gaboardi, Marco and
|
||||||
|
Gr{\'e}goire, Benjamin and
|
||||||
|
Hsu, Justin and
|
||||||
|
Strub, {P}ierre-{Y}ves},
|
||||||
|
year = 2016,
|
||||||
|
url = {http://arxiv.org/abs/1601.05047},
|
||||||
|
jh = yes,
|
||||||
|
eprint = yes,
|
||||||
|
}
|
||||||
|
|
||||||
@unpublished{HMRRV16,
|
@unpublished{HMRRV16,
|
||||||
title = {Do prices coordinate markets?},
|
title = {Do prices coordinate markets?},
|
||||||
author = {Hsu, Justin and
|
author = {Hsu, Justin and
|
||||||
|
@ -29,11 +42,11 @@
|
||||||
@unpublished{BEGGHS15,
|
@unpublished{BEGGHS15,
|
||||||
title = {Formal certification of randomized algorithms},
|
title = {Formal certification of randomized algorithms},
|
||||||
author = {Barthe, Gilles and
|
author = {Barthe, Gilles and
|
||||||
Espitau, Thomas and
|
Espitau, Thomas and
|
||||||
Gaboardi, Marco and
|
Gaboardi, Marco and
|
||||||
Gr{\'e}goire, Benjamin and
|
Gr{\'e}goire, Benjamin and
|
||||||
Hsu, Justin and
|
Hsu, Justin and
|
||||||
Strub, {P}ierre-{Y}ves},
|
Strub, {P}ierre-{Y}ves},
|
||||||
year = 2015,
|
year = 2015,
|
||||||
jh = yes,
|
jh = yes,
|
||||||
docs = yes
|
docs = yes
|
||||||
|
@ -67,6 +80,8 @@
|
||||||
jh = yes,
|
jh = yes,
|
||||||
slides = yes,
|
slides = yes,
|
||||||
eprint = yes,
|
eprint = yes,
|
||||||
|
volume = {9450},
|
||||||
|
pages = {387--401},
|
||||||
url = {http://arxiv.org/abs/1509.03476},
|
url = {http://arxiv.org/abs/1509.03476},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -176,7 +191,6 @@
|
||||||
year = {2014},
|
year = {2014},
|
||||||
pages = {612--624},
|
pages = {612--624},
|
||||||
url = {http://arxiv.org/abs/1402.3631},
|
url = {http://arxiv.org/abs/1402.3631},
|
||||||
doi = {10.1007/978-3-662-43948-7_51},
|
|
||||||
timestamp = {Fri, 31 Oct 2014 14:45:31 +0100},
|
timestamp = {Fri, 31 Oct 2014 14:45:31 +0100},
|
||||||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/icalp/HsuRRU14},
|
biburl = {http://dblp.uni-trier.de/rec/bib/conf/icalp/HsuRRU14},
|
||||||
bibsource = {dblp computer science bibliography, http://dblp.org},
|
bibsource = {dblp computer science bibliography, http://dblp.org},
|
||||||
|
@ -212,7 +226,6 @@
|
||||||
year = {2014},
|
year = {2014},
|
||||||
pages = {21--30},
|
pages = {21--30},
|
||||||
url = {http://arxiv.org/abs/1311.2828},
|
url = {http://arxiv.org/abs/1311.2828},
|
||||||
doi = {10.1145/2591796.2591826},
|
|
||||||
timestamp = {Wed, 22 Oct 2014 14:44:14 +0200},
|
timestamp = {Wed, 22 Oct 2014 14:44:14 +0200},
|
||||||
biburl = {http://dblp.uni-trier.de/rec/bib/conf/stoc/HsuHRRW14},
|
biburl = {http://dblp.uni-trier.de/rec/bib/conf/stoc/HsuHRRW14},
|
||||||
bibsource = {dblp computer science bibliography, http://dblp.org},
|
bibsource = {dblp computer science bibliography, http://dblp.org},
|
||||||
|
@ -297,7 +310,6 @@
|
||||||
@article{job-matching,
|
@article{job-matching,
|
||||||
title = {Job Matching, Coalition Formation, and Gross Substitutes},
|
title = {Job Matching, Coalition Formation, and Gross Substitutes},
|
||||||
volume = {50},
|
volume = {50},
|
||||||
doi = {10.2307/1913392},
|
|
||||||
number = {6},
|
number = {6},
|
||||||
urldate = {2013--07--07},
|
urldate = {2013--07--07},
|
||||||
journal = {Econometrica},
|
journal = {Econometrica},
|
||||||
|
@ -332,7 +344,6 @@
|
||||||
author = {Dwork, Cynthia and Naor, Moni and Vadhan, Salil},
|
author = {Dwork, Cynthia and Naor, Moni and Vadhan, Salil},
|
||||||
booktitle = focs12,
|
booktitle = focs12,
|
||||||
pages = {400--409},
|
pages = {400--409},
|
||||||
doi = {10.1109/FOCS.2012.87},
|
|
||||||
url = {http://projects.iq.harvard.edu/files/privacytools/files/06375318.pdf},
|
url = {http://projects.iq.harvard.edu/files/privacytools/files/06375318.pdf},
|
||||||
year = {2012}
|
year = {2012}
|
||||||
}
|
}
|
||||||
|
@ -424,7 +435,6 @@
|
||||||
number = {3-4},
|
number = {3-4},
|
||||||
pages = {211--407},
|
pages = {211--407},
|
||||||
url = {http://dx.doi.org/10.1561/0400000042},
|
url = {http://dx.doi.org/10.1561/0400000042},
|
||||||
doi = {10.1561/0400000042},
|
|
||||||
timestamp = {Tue, 28 Oct 2014 14:00:24 +0100},
|
timestamp = {Tue, 28 Oct 2014 14:00:24 +0100},
|
||||||
biburl = {http://dblp.uni-trier.de/rec/bib/journals/fttcs/DworkR14},
|
biburl = {http://dblp.uni-trier.de/rec/bib/journals/fttcs/DworkR14},
|
||||||
bibsource = {dblp computer science bibliography, http://dblp.org}
|
bibsource = {dblp computer science bibliography, http://dblp.org}
|
||||||
|
@ -524,7 +534,6 @@
|
||||||
url = {http://arxiv.org/abs/1207.6945},
|
url = {http://arxiv.org/abs/1207.6945},
|
||||||
year = 2013
|
year = 2013
|
||||||
}
|
}
|
||||||
}
|
|
||||||
@inproceedings{MT07,
|
@inproceedings{MT07,
|
||||||
author = {Frank McSherry and
|
author = {Frank McSherry and
|
||||||
Kunal Talwar},
|
Kunal Talwar},
|
||||||
|
@ -931,7 +940,6 @@
|
||||||
pages = {257--301},
|
pages = {257--301},
|
||||||
year = {1995},
|
year = {1995},
|
||||||
publisher = informs,
|
publisher = informs,
|
||||||
doi = {10.1287/moor.20.2.257}
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@inproceedings{AK07,
|
@inproceedings{AK07,
|
||||||
|
@ -1731,15 +1739,16 @@ year = {2014}
|
||||||
@article{Tschantz201161,
|
@article{Tschantz201161,
|
||||||
title = {Formal Verification of Differential Privacy for Interactive Systems
|
title = {Formal Verification of Differential Privacy for Interactive Systems
|
||||||
(Extended Abstract)},
|
(Extended Abstract)},
|
||||||
|
author = {Tschantz, Michael Carl and
|
||||||
|
Kaynar, Dilsun and
|
||||||
|
Datta, Anupam},
|
||||||
journal = entcs,
|
journal = entcs,
|
||||||
volume = "276",
|
volume = "276",
|
||||||
number = "0",
|
number = "0",
|
||||||
pages = {61--79},
|
pages = {61--79},
|
||||||
year = "2011",
|
year = "2011",
|
||||||
issn = "1571--0661",
|
issn = "1571--0661",
|
||||||
doi = "http://dx.doi.org/10.1016/j.entcs.2011.09.015",
|
url = {http://arxiv.org/pdf/1101.2819v1}
|
||||||
url = "http://www.sciencedirect.com/science/article/pii/S157106611100106X",
|
|
||||||
author = "Michael Carl Tschantz and Dilsun Kaynar and Anupam Datta",
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{GHKSW06,
|
@article{GHKSW06,
|
||||||
|
@ -2119,7 +2128,6 @@ year = {2014}
|
||||||
pages = {112--122},
|
pages = {112--122},
|
||||||
year = {2014},
|
year = {2014},
|
||||||
url = {http://doi.acm.org/10.1145/2594291.2594294},
|
url = {http://doi.acm.org/10.1145/2594291.2594294},
|
||||||
doi = {10.1145/2594291.2594294},
|
|
||||||
}
|
}
|
||||||
@inproceedings{DBLP:conf/pldi/CarbinKMR12,
|
@inproceedings{DBLP:conf/pldi/CarbinKMR12,
|
||||||
author = {Michael Carbin and
|
author = {Michael Carbin and
|
||||||
|
@ -2157,7 +2165,6 @@ year = {2014}
|
||||||
pages = {14},
|
pages = {14},
|
||||||
year = {2014},
|
year = {2014},
|
||||||
url = {http://doi.acm.org/10.1145/2594291.2594294},
|
url = {http://doi.acm.org/10.1145/2594291.2594294},
|
||||||
doi = {10.1145/2594291.2594294},
|
|
||||||
}
|
}
|
||||||
@inproceedings{DBLP:conf/pldi/CarbinKMR12,
|
@inproceedings{DBLP:conf/pldi/CarbinKMR12,
|
||||||
author = {Michael Carbin and
|
author = {Michael Carbin and
|
||||||
|
@ -2395,7 +2402,6 @@ year = {2009},
|
||||||
booktitle = {Declarative Agent Languages and Technologies VI},
|
booktitle = {Declarative Agent Languages and Technologies VI},
|
||||||
volume = {5397},
|
volume = {5397},
|
||||||
series = {LNCS},
|
series = {LNCS},
|
||||||
doi = {10.1007/978-3-540-93920-7_13},
|
|
||||||
title = {Abstracting and Verifying Strategy-Proofness for Auction Mechanisms},
|
title = {Abstracting and Verifying Strategy-Proofness for Auction Mechanisms},
|
||||||
publisher = {Springer Berlin Heidelberg},
|
publisher = {Springer Berlin Heidelberg},
|
||||||
author = {Tadjouddine, Emmanuel M. and Guerin, Frank and Vasconcelos, Wamberto},
|
author = {Tadjouddine, Emmanuel M. and Guerin, Frank and Vasconcelos, Wamberto},
|
||||||
|
@ -2505,7 +2511,6 @@ language = {English}
|
||||||
booktitle = {Interactive Theorem Proving (ITP)},
|
booktitle = {Interactive Theorem Proving (ITP)},
|
||||||
pages = {163--179},
|
pages = {163--179},
|
||||||
year = {2013},
|
year = {2013},
|
||||||
doi = {10.1007/978-3-642-39634-2_14},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@article{clarke71,
|
@article{clarke71,
|
||||||
|
@ -2726,7 +2731,6 @@ year = {2011}
|
||||||
booktitle = popl10,
|
booktitle = popl10,
|
||||||
year = {2010},
|
year = {2010},
|
||||||
pages = {57--70},
|
pages = {57--70},
|
||||||
doi = {http://doi.acm.org/10.1145/1707801.1706308},
|
|
||||||
}
|
}
|
||||||
|
|
||||||
@InProceedings{CGLN11,
|
@InProceedings{CGLN11,
|
||||||
|
@ -2756,7 +2760,6 @@ year = {2011}
|
||||||
year = {2008},
|
year = {2008},
|
||||||
isbn = {978-1-59593-860-2},
|
isbn = {978-1-59593-860-2},
|
||||||
pages = {193--205},
|
pages = {193--205},
|
||||||
doi = {http://doi.acm.org/10.1145/1375581.1375606},
|
|
||||||
address = {New York, NY, USA},
|
address = {New York, NY, USA},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -2766,7 +2769,6 @@ year = {2011}
|
||||||
booktitle = icalp11,
|
booktitle = icalp11,
|
||||||
year = {2011},
|
year = {2011},
|
||||||
series = lncs,
|
series = lncs,
|
||||||
doi = {10.1007/978-3-642-22012-8_4},
|
|
||||||
publisher = springer,
|
publisher = springer,
|
||||||
volume = {6756},
|
volume = {6756},
|
||||||
pages = {60--76},
|
pages = {60--76},
|
||||||
|
@ -3248,7 +3250,6 @@ number = "1",
|
||||||
pages = "66--95",
|
pages = "66--95",
|
||||||
year = "2000",
|
year = "2000",
|
||||||
issn = "0022-0531",
|
issn = "0022-0531",
|
||||||
doi = "http://dx.doi.org/10.1006/jeth.1999.2580",
|
|
||||||
url = "http://www.sciencedirect.com/science/article/pii/S0022053199925802",
|
url = "http://www.sciencedirect.com/science/article/pii/S0022053199925802",
|
||||||
author = "Faruk Gul and Ennio Stacchetti"
|
author = "Faruk Gul and Ennio Stacchetti"
|
||||||
}
|
}
|
||||||
|
@ -3275,7 +3276,6 @@ booktitle=ipco06,
|
||||||
volume={1084},
|
volume={1084},
|
||||||
series={Lecture Notes in Computer Science},
|
series={Lecture Notes in Computer Science},
|
||||||
editor={Cunningham, William H and McCormick, S Thomas and Queyranne, Maurice},
|
editor={Cunningham, William H and McCormick, S Thomas and Queyranne, Maurice},
|
||||||
doi={10.1007/3-540-61310-2_20},
|
|
||||||
title={Convexity and {S}teinitz's exchange property},
|
title={Convexity and {S}teinitz's exchange property},
|
||||||
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
|
url={http://dx.doi.org/10.1007/3-540-61310-2_20},
|
||||||
publisher={Springer Berlin Heidelberg},
|
publisher={Springer Berlin Heidelberg},
|
||||||
|
@ -3292,7 +3292,6 @@ volume = {24},
|
||||||
number = {1},
|
number = {1},
|
||||||
pages = {95--105},
|
pages = {95--105},
|
||||||
year = {1999},
|
year = {1999},
|
||||||
doi = {10.1287/moor.24.1.95},
|
|
||||||
URL = {http://dx.doi.org/10.1287/moor.24.1.95},
|
URL = {http://dx.doi.org/10.1287/moor.24.1.95},
|
||||||
eprint = {http://dx.doi.org/10.1287/moor.24.1.95},
|
eprint = {http://dx.doi.org/10.1287/moor.24.1.95},
|
||||||
abstract = { The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems. }
|
abstract = { The concept of M-convex function, introduced by Murota (1996), is a quantitative generalization of the set of integral points in an integral base polyhedron as well as an extension of valuated matroid of Dress and Wenzel (1990). In this paper, we extend this concept to functions on generalized polymatroids with a view to providing a unified framework for efficiently solvable nonlinear discrete optimization problems. }
|
||||||
|
@ -3306,7 +3305,6 @@ volume = {28},
|
||||||
number = {3},
|
number = {3},
|
||||||
pages = {463--469},
|
pages = {463--469},
|
||||||
year = {2003},
|
year = {2003},
|
||||||
doi = {10.1287/moor.28.3.463.16393},
|
|
||||||
URL = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
URL = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
||||||
eprint = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
eprint = {http://dx.doi.org/10.1287/moor.28.3.463.16393},
|
||||||
abstract = { In their 1982 article, Kelso and Crawford proposed a gross substitutes condition for the existence of core (and equilibrium) in a two-sided matching model. Since then, this condition has often been used in the literature on matching models and equilibrium models in the presence of indivisibilities. In this paper we prove that a reservation value (or utility) function satisfies the gross substitutes condition if and only if it is an M♮-concave function defined on the unit-hypercube, which is a discrete concave function recently introduced by Murota and Shioura (1999). }
|
abstract = { In their 1982 article, Kelso and Crawford proposed a gross substitutes condition for the existence of core (and equilibrium) in a two-sided matching model. Since then, this condition has often been used in the literature on matching models and equilibrium models in the presence of indivisibilities. In this paper we prove that a reservation value (or utility) function satisfies the gross substitutes condition if and only if it is an M♮-concave function defined on the unit-hypercube, which is a discrete concave function recently introduced by Murota and Shioura (1999). }
|
||||||
|
@ -3320,7 +3318,6 @@ number = "1",
|
||||||
pages = "6--20",
|
pages = "6--20",
|
||||||
year = "2010",
|
year = "2010",
|
||||||
issn = "0304-4068",
|
issn = "0304-4068",
|
||||||
doi = "http://dx.doi.org/10.1016/j.jmateco.2009.05.008",
|
|
||||||
url = "http://www.sciencedirect.com/science/article/pii/S0304406809000627",
|
url = "http://www.sciencedirect.com/science/article/pii/S0304406809000627",
|
||||||
author = "Debasis Mishra and Dolf Talman",
|
author = "Debasis Mishra and Dolf Talman",
|
||||||
keywords = "Assignment model",
|
keywords = "Assignment model",
|
||||||
|
@ -3462,7 +3459,6 @@ keywords = "Underdemanded set "
|
||||||
|
|
||||||
@article{nisan06communication,
|
@article{nisan06communication,
|
||||||
Author = {Nisan, Noam and Segal, Ilya},
|
Author = {Nisan, Noam and Segal, Ilya},
|
||||||
Doi = {http://dx.doi.org/10.1016/j.jet.2004.10.007},
|
|
||||||
Issn = {0022-0531},
|
Issn = {0022-0531},
|
||||||
Journal = jet,
|
Journal = jet,
|
||||||
Keywords = {Distributional complexity},
|
Keywords = {Distributional complexity},
|
||||||
|
@ -3535,3 +3531,84 @@ Hartline, Jason D and Talwar, Kunal},
|
||||||
year = {1999},
|
year = {1999},
|
||||||
publisher = {Cambridge University Press},
|
publisher = {Cambridge University Press},
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@inproceedings{DNRR15,
|
||||||
|
year={2015},
|
||||||
|
isbn={978-3-662-48799-0},
|
||||||
|
booktitle=ascrypt15,
|
||||||
|
title={Pure Differential Privacy for Rectangle Queries via Private Partitions},
|
||||||
|
url={http://dx.doi.org/10.1007/978-3-662-48800-3_30},
|
||||||
|
publisher={Springer Berlin Heidelberg},
|
||||||
|
author={Dwork, Cynthia and Naor, Moni and Reingold, Omer and Rothblum, Guy N},
|
||||||
|
pages={735--751},
|
||||||
|
language={English}
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{BartheO13,
|
||||||
|
author = {Barthe, Gilles and
|
||||||
|
Olmedo, Federico},
|
||||||
|
editor = {Fedor V. Fomin and
|
||||||
|
Rusins Freivalds and
|
||||||
|
Marta Z. Kwiatkowska and
|
||||||
|
David Peleg},
|
||||||
|
title = {Beyond Differential Privacy: Composition Theorems and Relational Logic
|
||||||
|
for $f$-divergences between Probabilistic Programs},
|
||||||
|
booktitle = icalp13,
|
||||||
|
series = {Lecture Notes in Computer Science},
|
||||||
|
volume = {7966},
|
||||||
|
pages = {49--60},
|
||||||
|
publisher = {Springer},
|
||||||
|
year = {2013},
|
||||||
|
url = {http://certicrypt.gforge.inria.fr/2013.ICALP.pdf}
|
||||||
|
}
|
||||||
|
|
||||||
|
@InProceedings{conf/popl/EbadiSS15,
|
||||||
|
title = "Differential Privacy: Now it's Getting Personal",
|
||||||
|
author = "Hamid Ebadi and David Sands and Gerardo Schneider",
|
||||||
|
booktitle = popl15,
|
||||||
|
year = "2015",
|
||||||
|
ISBN = "978-1-4503-3300-9",
|
||||||
|
pages = "69--81",
|
||||||
|
URL = "http://dl.acm.org/citation.cfm?id=2676726",
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{DBLP:conf/stoc/DworkFHPRR15,
|
||||||
|
author = {Dwork, Cynthia and
|
||||||
|
Feldman, Vitaly and
|
||||||
|
Hardt, Moritz and
|
||||||
|
Pitassi, Toniann and
|
||||||
|
Reingold, Omer and
|
||||||
|
Roth, Aaron},
|
||||||
|
title = {Preserving Statistical Validity in Adaptive Data Analysis},
|
||||||
|
booktitle = stoc15,
|
||||||
|
pages = {117--126},
|
||||||
|
year = {2015},
|
||||||
|
url = {http://doi.acm.org/10.1145/2746539.2746580},
|
||||||
|
}
|
||||||
|
@inproceedings{xu:hal-00879140,
|
||||||
|
TITLE = {Metrics for Differential Privacy in Concurrent Systems},
|
||||||
|
AUTHOR = {Xu, Lili and Chatzikokolakis, Konstantinos and Lin, Huimin},
|
||||||
|
URL = {https://hal.inria.fr/hal-00879140},
|
||||||
|
BOOKTITLE = {IFIP International Conference on Formal Techniques for Distributed
|
||||||
|
Objects, Components and Systems (FORTE), Berlin, Germany},
|
||||||
|
ADDRESS = {Berlin, Germany},
|
||||||
|
ORGANIZATION = {{IFIP}},
|
||||||
|
EDITOR = {Erika Abraham and Catuscia Palamidessi},
|
||||||
|
PUBLISHER = {{Springer}},
|
||||||
|
SERIES = {Lecture Notes in Computer Science},
|
||||||
|
VOLUME = {8461},
|
||||||
|
PAGES = {199--215},
|
||||||
|
YEAR = {2014},
|
||||||
|
MONTH = Jun,
|
||||||
|
KEYWORDS = {differential privacy ; probabilistic automata ; bisimulation metrics ; verification},
|
||||||
|
PDF = {https://hal.inria.fr/hal-00879140/file/forte-hal.pdf},
|
||||||
|
HAL_ID = {hal-00879140},
|
||||||
|
HAL_VERSION = {v2},
|
||||||
|
}
|
||||||
|
|
||||||
|
@inproceedings{Kozen79,
|
||||||
|
Author = {Kozen, Dexter},
|
||||||
|
Booktitle = focs79,
|
||||||
|
Pages = {101--114},
|
||||||
|
Title = {Semantics of probabilistic programs},
|
||||||
|
Year = {1979}}
|
||||||
|
|
|
@ -1,3 +1,5 @@
|
||||||
|
+ **01/2016** Our preprint **Proving Differential Privacy via Probabilistic
|
||||||
|
Couplings** is now available on `arXiv`.
|
||||||
+ **01/2016** Slides now available for **Jointly private convex programming**,
|
+ **01/2016** Slides now available for **Jointly private convex programming**,
|
||||||
presented at **SODA 2016**.
|
presented at **SODA 2016**.
|
||||||
+ **11/2015** Slides now available for **Relational reasoning via probabilistic
|
+ **11/2015** Slides now available for **Relational reasoning via probabilistic
|
||||||
|
|
Loading…
Reference in New Issue