Verifiable Single-Server Private Information Retrieval
暂无分享,去创建一个
[1] Chris Peikert,et al. Generating Shorter Bases for Hard Random Lattices , 2009, STACS.
[2] Reihaneh Safavi-Naini,et al. Verifiable Multi-server Private Information Retrieval , 2014, ACNS.
[3] Johannes A. Buchmann,et al. On the Hardness of LWE with Binary Error: Revisiting the Hybrid Lattice-Reduction and Meet-in-the-Middle Attack , 2016, AFRICACRYPT.
[4] Craig Gentry,et al. Trapdoors for hard lattices and new cryptographic constructions , 2008, IACR Cryptol. ePrint Arch..
[5] Sanjeev Kumar Mishra. On Symmetrically Private Information Retrieval , 2000, IACR Cryptol. ePrint Arch..
[6] Daniele Micciancio,et al. Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions , 2011, CRYPTO.
[7] Yael Tauman Kalai,et al. Improved Delegation of Computation using Fully Homomorphic Encryption , 2010, IACR Cryptol. ePrint Arch..
[8] Craig Gentry,et al. A Simple BGN-Type Cryptosystem from LWE , 2010, EUROCRYPT.
[9] Oded Regev,et al. On lattices, learning with errors, random linear codes, and cryptography , 2009, JACM.
[10] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[11] Eyal Kushilevitz,et al. Private information retrieval , 1995, Proceedings of IEEE 36th Annual Foundations of Computer Science.
[12] Chris Peikert,et al. Hardness of SIS and LWE with Small Parameters , 2013, CRYPTO.
[13] Ian Goldberg,et al. Improving the Robustness of Private Information Retrieval , 2007 .
[14] Craig Gentry,et al. Fully Homomorphic Encryption over the Integers , 2010, EUROCRYPT.
[15] Noboru Kunihiro,et al. Private Information Retrieval with Preprocessing Based on the Approximate GCD Problem , 2015, SAC.
[16] Chris Peikert,et al. Public-key cryptosystems from the worst-case shortest vector problem: extended abstract , 2009, STOC '09.