Constant-Round multi-party private set union using reversed laurent series
作者： Jae Hong Seo , Jung Hee Cheon , Jonathan Katz
DOI: 10.1007/978-3-642-30057-8_24
关键词:
摘要: We introduce the idea of associating a set elements with rational function represented using reversed Laurent series . Using this representation, we propose private set-union protocols in multi-party setting, assuming an honest majority. Our are first efficient protocol for union constant round complexity (in both semi-honest and malicious settings), as well statistical security setting).
springer.com
springerlink.com参考文章(38)
Public Key Cryptography - PKC 2011 Lecture Notes in Computer Science. ,vol. 6571, ,(2011) , 10.1007/978-3-642-19379-8
Emiliano De Cristofaro, Gene Tsudik, Practical private set intersection protocols with linear complexity financial cryptography. ,vol. 6052, pp. 143- 159 ,(2010) , 10.1007/978-3-642-14577-3_13
Victor Shoup, A Computational Introduction to Number Theory and Algebra ,(2005)
Keith Frikken, Privacy-Preserving Set Union Applied Cryptography and Network Security. pp. 237- 252 ,(2007) , 10.1007/978-3-540-72738-5_16
Jan Camenisch, Markus Stadler, Proof systems for general statements about discrete logarithms ,(1997) , 10.3929/ETHZ-A-006651937
Emiliano De Cristofaro, Jihye Kim, Gene Tsudik, Linear-complexity private set intersection protocols secure in malicious model international conference on the theory and application of cryptology and information security. pp. 213- 231 ,(2010) , 10.1007/978-3-642-17373-8_13
Jens Groth, Aggelos Kiayias, Helger Lipmaa, Multi-query computationally-private information retrieval with constant communication rate public key cryptography. pp. 107- 123 ,(2010) , 10.1007/978-3-642-13013-7_7
Joseph Bonneau, Mike Just, Greg Matthews, What's in a name? Evaluating statistical attacks on personal knowledge questions financial cryptography. pp. 98- 113 ,(2010) , 10.1007/978-3-642-14577-3_10
Justin Brickell, Vitaly Shmatikov, Privacy-Preserving Graph Algorithms in the Semi-honest Model Lecture Notes in Computer Science. pp. 236- 252 ,(2005) , 10.1007/11593447_13
Giuseppe Ateniese, Emiliano De Cristofaro, Gene Tsudik, (If) size matters: size-hiding private set intersection public key cryptography. pp. 156- 173 ,(2011) , 10.1007/978-3-642-19379-8_10