| [1] Peikert C, Waters B. Lossy trapdoor functions and their applications[C]//Cynthia Dwork (Ed.). Proceedings of STOC 2008. Victoria, British Columbia, Canada: ACM, 2008: 187-196.[2] Mol P, Yilek S. Chosen-ciphertext security from slightly lossy trapdoor functions[C]//Phong Q Nguyen, David Pointcheval (Eds.). Proceedings of PKC 2010: LNCS 6056. Paris, France: Springer, 2010: 296-377.[3] Freeman D M, Goldreich O, Kiltz E, et al. More constructions of lossy and correlation-secure trapdoor functions[C]//Phong Q Nguyen, David Pointcheval (Eds.). Proceedings of PKC 2010: LNCS 6056. Paris, France: Springer, 2010: 279-295.[4] Hofheinz D. All-but-many lossy trapdoor functions[C]//David Pointcheval, Thomas Johansson (Eds.). Proceedings of EUROCRYPT 2012: LNCS 7237. Cambridge, UK: Springer, 2012: 209-227.[5] Hemenway B, Ostrovsky R. Extended-DDH and lossy trapdoor functions[C]//Marc Fischlin, Johannes Buchmann, Mark Manulis (Eds.). Proceedings of PKC 2012: LNCS 7293. Darmstadt, Germany: Springer, 2012: 627-643.[6] Dodis Y, Kalai Y T, Lovett S. On cryptography with auxiliary input[C]//Michael Mitzenmacher (Ed.). Proceedings of STOC 2009. Bethesda, MD, USA: ACM, 2009: 621-630.[7] Dodis Y, Goldwasser S, Kalai Y, et al. Public key encryption schemes with auxiliary inputs[C]//Henri Gilbert (Ed.). Proceedings of EUROCRYPT 2010: LNCS 5978. French Riviera: Springer, 2010: 361-381.[8] Goldwasser S, Kalai Y, Peikert C, et al. Robustness of the learning with errors assumption[C]//Andrew Chi-Chih Yao (Eds.). Proceedings of ICS 2010. Beijing, China: Tsinghua University, 2010: 230-240.[9] Brakerski Z, Segev G. Better security for deterministic public encryption: the auxiliary-input setting[C] //Phillip Rogaway (Ed.). Proceedings of CRYPTO 2011: LNCS 7073. Santa Barbara, CA, USA: Springer, 2011: 543-560.[10] Regev O. On lattices, learning with errors, random linear codes, and cryptography[C]//Harold N Gabow, Ronald Fagin (Eds.). Proceedings of STOC 2005. Baltimore, Maryland, USA: ACM, 2005: 84-93. |
