Labeled PSI from Fully Homomorphic Encryption with Malicious Security
暂无分享,去创建一个
Hao Chen | Zhicong Huang | Kim Laine | Peter Rindal | Kim Laine | Hao Chen | Zhicong Huang | Peter Rindal
[1] Craig Gentry,et al. Private Database Queries Using Somewhat Homomorphic Encryption , 2013, ACNS.
[2] Jung Hee Cheon,et al. Optimized Search-and-Compute Circuits and Their Application to Query Evaluation on Encrypted Data , 2016, IEEE Transactions on Information Forensics and Security.
[3] Frederik Vercauteren,et al. Fully homomorphic SIMD operations , 2012, Designs, Codes and Cryptography.
[4] Jung Hee Cheon,et al. Homomorphic Computation of Edit Distance , 2015, IACR Cryptol. ePrint Arch..
[5] Shai Halevi,et al. Algorithms in HElib , 2014, CRYPTO.
[6] Vinod Vaikuntanathan,et al. SHIELD: Scalable Homomorphic Implementation of Encrypted Data-Classifiers , 2015, IEEE Transactions on Computers.
[7] Benny Pinkas,et al. Private Set Intersection for Unequal Set Sizes with Mobile Applications , 2017, Proc. Priv. Enhancing Technol..
[8] Zvika Brakerski,et al. Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP , 2012, CRYPTO.
[9] Raphael Machado,et al. A controller design for mitigation of passive system identification attacks in networked control systems , 2017, Journal of Internet Services and Applications.
[10] Hao Chen,et al. Fast Private Set Intersection from Homomorphic Encryption , 2017, CCS.
[11] Yehuda Lindell,et al. Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries , 2008, TCC.
[12] Nicolas Gama,et al. Faster Fully Homomorphic Encryption: Bootstrapping in Less Than 0.1 Seconds , 2016, ASIACRYPT.
[13] Ian Goldberg,et al. Privacy-Preserving Queries over Relational Databases , 2010, Privacy Enhancing Technologies.
[14] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[15] Vinod Vaikuntanathan,et al. Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages , 2011, CRYPTO.
[16] Benny Pinkas,et al. Keyword Search and Oblivious Pseudorandom Functions , 2005, TCC.
[17] Brent Waters,et al. Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based , 2013, CRYPTO.
[18] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[19] Emmanuela Orsini,et al. Actively Secure 1-out-of-N OT Extension with Application to Private Set Intersection , 2017, CT-RSA.
[20] Catherine A. Meadows,et al. A More Efficient Cryptographic Matchmaking Protocol for Use in the Absence of a Continuously Available Third Party , 1986, 1986 IEEE Symposium on Security and Privacy.
[21] Jung Hee Cheon,et al. Homomorphic Encryption for Arithmetic of Approximate Numbers , 2017, ASIACRYPT.
[22] Emiliano De Cristofaro,et al. Do I know you?: efficient and privacy-preserving common friend-finder protocols and applications , 2013, ACSAC.
[23] Claudio Orlandi,et al. Combining Private Set-Intersection with Secure Two-Party Computation , 2018, IACR Cryptol. ePrint Arch..
[24] Diego F. Aranha,et al. Faster Unbalanced Private Set Intersection , 2018, Financial Cryptography.
[25] Moti Yung,et al. Private Intersection-Sum Protocol with Applications to Attributing Aggregate Ad Conversions , 2017, IACR Cryptol. ePrint Arch..
[26] Xiaomin Liu,et al. Fast Secure Computation of Set Intersection , 2010, SCN.
[27] Ronald L. Rivest,et al. ON DATA BANKS AND PRIVACY HOMOMORPHISMS , 1978 .
[28] Emiliano De Cristofaro,et al. Fast and Private Computation of Cardinality of Set Intersection and Union , 2012, CANS.
[29] Frederik Vercauteren,et al. Somewhat Practical Fully Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[30] Benny Pinkas,et al. Faster Private Set Intersection Based on OT Extension , 2014, USENIX Security Symposium.
[31] Jung Hee Cheon,et al. Logistic regression model training based on the approximate homomorphic encryption , 2018, BMC Medical Genomics.
[32] William B. Hart,et al. FLINT : Fast library for number theory , 2013 .
[33] Craig Gentry,et al. Homomorphic Evaluation of the AES Circuit , 2012, IACR Cryptol. ePrint Arch..
[34] Benny Pinkas,et al. Scalable Private Set Intersection Based on OT Extension , 2018, IACR Cryptol. ePrint Arch..
[35] Craig Gentry,et al. (Leveled) fully homomorphic encryption without bootstrapping , 2012, ITCS '12.
[36] Srinath T. V. Setty,et al. PIR with Compressed Queries and Amortized Query Processing , 2018, 2018 IEEE Symposium on Security and Privacy (SP).
[37] Benny Pinkas,et al. Phasing: Private Set Intersection Using Permutation-based Hashing , 2015, USENIX Security Symposium.
[38] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[39] Emiliano De Cristofaro,et al. Countering GATTACA: efficient and secure testing of fully-sequenced human genomes , 2011, CCS '11.
[40] Mariana Raykova,et al. Scaling Private Set Intersection to Billion-Element Sets , 2014, Financial Cryptography.
[41] Jung Hee Cheon,et al. Search-and-compute on Encrypted Data , 2015, IACR Cryptol. ePrint Arch..
[42] Frank Wang,et al. Splinter: Practical Private Queries on Public Data , 2017, NSDI.
[43] Satyanarayana V. Lokam,et al. SECURITY OF HOMOMORPHIC ENCRYPTION , 2017 .
[44] Julien Eynard,et al. A Full RNS Variant of FV Like Somewhat Homomorphic Encryption Schemes , 2016, SAC.
[45] Michael Naehrig,et al. Manual for Using Homomorphic Encryption for Bioinformatics , 2017, Proceedings of the IEEE.
[46] Andrew M. Odlyzko,et al. Privacy, economics, and price discrimination on the Internet , 2003, ICEC '03.
[47] Moni Naor,et al. Private Information Retrieval by Keywords , 1998, IACR Cryptol. ePrint Arch..
[48] Srinath T. V. Setty,et al. Unobservable Communication over Fully Untrusted Infrastructure , 2016, OSDI.
[49] Vladimir Kolesnikov,et al. Efficient Batched Oblivious PRF with Applications to Private Set Intersection , 2016, CCS.
[50] Peter Rindal,et al. Malicious-Secure Private Set Intersection via Dual Execution , 2017, CCS.
[51] Benny Pinkas,et al. Efficient Circuit-based PSI via Cuckoo Hashing , 2018, IACR Cryptol. ePrint Arch..