Author:
Abdalla Michel,Bellare Mihir,Catalano Dario,Kiltz Eike,Kohno Tadayoshi,Lange Tanja,Malone-Lee John,Neven Gregory,Paillier Pascal,Shi Haixia
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,Software
Reference26 articles.
1. M. Abdalla, M. Bellare, D. Catalano, E. Kiltz, T. Kohno, T. Lange, J. Malone-Lee, G. Neven, P. Paillier, H. Shi, Searchable encryption revisited: consistency properties, relation to anonymous IBE, and extensions, Cryptology ePrint Archive, 2005.
http://eprint.iacr.org/
2. M. Ajtai, C. Dwork, A public-key cryptosystem with worst-case/average-case equivalence, in 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, USA, May 4–6, 1997 (ACM Press, New York, 1997), pp. 284–293
3. Lecture Notes in Computer Science;M. Bellare,2001
4. Lecture Notes in Computer Science;M. Bellare,1994
5. M. Bellare, P. Rogaway, Random oracles are practical: a paradigm for designing efficient protocols, in ACM CCS 93: 1st Conference on Computer and Communications Security, Fairfax, VA, November 3–5, 1993 (ACM Press, New York, 1993), pp. 62–73
Cited by
214 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献