[1]
|
M. Abe, G. Fuchsbauer, J. Groth, K. Haralambiev and M. Ohkubo, Structure-preserving signatures and commitments to group elements, in Advances in Cryptology -CRYPTO 2010, Springer, 2010,209-236.
|
[2]
|
G. Ateniese, E. De Cristofaro and G. Tsudik, (If) Size matters: Size-hiding private set intersection, in Public Key Cryptography -PKC 2011, Springer, 2011,156-173.
|
[3]
|
P. Baldi, R. Baronio, E. De Cristofaro, P. Gasti and G. Tsudik, Countering gattaca: Efficient and secure testing of fully-sequenced human genomes, in Proc. 18th ACM Conf. Comp. Commun. Secur. -CCS'11, ACM, New York, 2011,691-702.
|
[4]
|
M. Bellare, R. Canetti and H. Krawczyk, A modular approach to the design and analysis of authentication and key exchange protocols (extended abstract), in Proc. 30th Ann. ACM Symp. Theory Comp. -STOC'98, ACM, New York, 1998,419-428.
|
[5]
|
M. Bellare, C. Namprempre, D. Pointcheval and M. Semanko, The one-more-RSA-inversion problems and the security of Chaum's blind signature scheme, J. Cryptology, 16 (2003), 185-215.
|
[6]
|
M. Bellare and P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in Proc. 1st ACM Conf. Comp. Commun. Secur. -CCS '93, ACM, New York, 1993, 62-73.
|
[7]
|
M. Bellare and P. Rogaway, The exact security of digital signatures -how to sign with RSA and Rabin, in Advances in Cryptology -EUROCRYPT 1996, Springer, 1996,399-416.
|
[8]
|
A. Boldyreva, Threshold signatures, multisignatures and blind signatures based on the gapDiffie-Hellman group signature scheme, in Public Key Cryptography -PKC 2003, Springer, 2002, 31-46.
|
[9]
|
E. Bursztein, M. Hamburg, J. Lagarenne and D. Boneh, Openconflict: Preventing real time map hacks in online games, in Proc. 32nd IEEE Symp. Secur. Privacy, IEEE Comp. Soc., Berkeley, 2011,506-520.
|
[10]
|
J. Camenisch and G. M. Zaverucha, Private intersection of certified sets, in Financial Cryptography and Data Security, Springer, 2009,108-127.
|
[11]
|
R. Canetti, Security and composition of multiparty cryptographic protocols, J. Cryptology, 13 (2000), 143-202.
|
[12]
|
R. Canetti and H. Krawczyk, Analysis of key-exchange protocols and their use for building secure channels, in Advances in Cryptology -EUROCRYPT 2001, Springer, 2001,453-474.
|
[13]
|
R. Canetti and H. Krawczyk, Universally composable notions of key exchange and secure channels, in Advances in Cryptology -EUROCRYPT 2002, Springer, 2002, 337-351.
|
[14]
|
R. Canetti and T. Rabin, Universal composition with joint state, in Advances in Cryptology -CRYPTO 2003, Springer, 2003,265-281.
|
[15]
|
D. Chaum, Blind signatures for untraceable payments, in Advances in Cryptology -Proc. CRYPTO '82, Plenum Press, New York, 1982,199-203.
|
[16]
|
J.-H. Cheon, S. Jarecki and J.-H. Seo, Multi-party privacy-preserving set intersection with quasi-linear complexity, IEICE Trans., 95-A (2012), 1366-1378.
|
[17]
|
J. -S. Coron, On the exact security of full domain hash, in Advances in Cryptology -CRYPTO 2000, Springer, 2000,229-235.
|
[18]
|
D. Dachman-Soled, T. Malkin, M. Raykova and M. Yung, Efficient robust private set intersection, Int. J. Appl. Crypt., 2 (2012), 289-303.
|
[19]
|
E. De Cristofaro, J. Kim and G. Tsudik, Linear-complexity private set intersection protocols secure in malicious model, in Advances in Cryptology -ASIACRYPT 2010, Springer, 2010,213-231.
|
[20]
|
E. De Cristofaro and G. Tsudik, Practical private set intersection protocols with linear complexity, in Financial Cryptography and Data Security, Springer, 2010,143-159.
|
[21]
|
E. De Cristofaro and G. Tsudik, Experimenting with fast private set intersection, in Trust and Trustworthy Computing, Springer, 2012, 55-73.
|
[22]
|
C. Dong, L. Chen and Z. Wen, When private set intersection meets big data: an efficient and scalable protocol, in Proc. 2013 ACM SIGSAC Conf. Comp. Commun. Secur. -CCS '13, ACM, New York, 2013,789-800.
|
[23]
|
M. Freedman, K. Nissim and B. Pinkas, Efficient private matching and set intersection, in Advances in Cryptology -EUROCRYPT 2004, Springer, 2004, 1-19.
|
[24]
|
O. Goldreich, The Foundations of Cryptography -Volume 2, Basic Applications, Cambridge Univ. Press, 2004.
|
[25]
|
S. Goldwasser and S. Micali, Probabilistic encryption & how to play mental poker keeping secret all partial information, in Proc. 14th Ann. ACM Symp. Theory Comp. STOC '82, ACM, New York, 1982,365-377.
|
[26]
|
C. Hazey, Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs, In Proc. 12th Theory Crypt. Conf. -TCC 2015, Springer, 90-120.
|
[27]
|
C. Hazay and Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, in Theory of Cryptography, Springer, 2008,155-175.
|
[28]
|
C. Hazay and Y. Lindell, Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries, J. Cryptology, 23 (2010), 422-456.
|
[29]
|
C. Hazay and K. Nissim, Efficient set operations in the presence of malicious adversaries, in Public Key Cryptography -PKC 2010, Springer, 2010, 312-331.
|
[30]
|
Y. Huang, D. Evans and J. Katz, Private set intersection: Are garbled circuits better than custom protocols?, in 19th Ann. Network Distrib. System Secur. Symp. 2012, San Diego, California, 2012.
|
[31]
|
S. Jarecki and X. Liu, Efficient oblivious pseudorandom function with applications to adaptive OT and secure computation of set intersection, in Theory of Cryptography, Springer, 2009,577-594.
|
[32]
|
S. Jarecki and X. Liu, Fast secure computation of set intersection, in Security and Cryptography for Networks, Springer, 2010,418-435.
|
[33]
|
A. Juels, M. Luby and R. Ostrovsky, Security of blind digital signatures, in Advances in Cryptology -CRYPTO '97, Springer, 1997,150-164.
|
[34]
|
L. Kissner and D. Song, Privacy-preserving set operations, in Advances in Cryptology -CRYPTO 2005 (ed. V. Shoup), Springer, 2005,241-257.
|
[35]
|
Y. Lindell and B. Pinkas, Privacy preserving data mining, J. Cryptology, 15 (2002), 177-206.
|
[36]
|
A. Menezes, P. van Oorschot and S. Vanstone, Handbook of Applied Cryptography, CRC, 1996.
|
[37]
|
B. Pinkas, T. Schneider and M. Zohner, Faster private set intersection based on ot extension, in Proc. 23rd USENIX Secur. Symp., 797-812, 2014.
|
[38]
|
E. Stefanov, E. Shi and D. Song, Policy-enhanced private set intersection: Sharing information while enforcing privacy policies, in Public Key Cryptography -PKC 2012 (M. Fischlin, J. Buchmann and M. Manulis), Springer, 2012,413-430.
|