Author:
Kitagawa Fuyuki,Matsuda Takahiro,Tanaka Keisuke
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference58 articles.
1. B. Applebaum, D. Cash, C. Peikert, A. Sahai, Fast cryptographic primitives and circular-secure encryption based on hard learning problems, in S. Halevi, editor, CRYPTO 2009. LNCS, vol 5677 (Springer, Heidelberg, 2009), pp. 595–618
2. M. Alekhnovich, More on average case vs approximation complexity, in 44th FOCS (IEEE Computer Society Press, 2003), pp. 298–307
3. B. Applebaum, Key-dependent message security: generic amplification and completeness, in K.G. Paterson, editor, EUROCRYPT 2011. LNCS, vol. 6632 (Springer, Heidelberg, 2011), pp. 527–546
4. M. Bellare, A. Boldyreva, A. O’Neill, Deterministic and efficiently searchable encryption, in A. Menezes, editor, CRYPTO 2007. LNCS, vol. 4622 (Springer, Heidelberg, 2007), pp. 535–552
5. M. Bellare, A. Boldyreva, J. Staddon, Randomness re-use in multi-recipient encryption schemeas, in Y. Desmedt, editor, PKC 2003. LNCS, vol. 2567 (Springer, Heidelberg, 2003), pp. 85–99
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献