Year |
Citation |
Score |
2015 |
Bellare M. New Proofs for NMAC and HMAC: Security without Collision Resistance Journal of Cryptology. 28: 844-878. DOI: 10.1007/S00145-014-9185-X |
0.447 |
|
2015 |
Bellare M, Hofheinz D, Kiltz E. Subtleties in the Definition of IND-CCA: When and How Should Challenge Decryption Be Disallowed? Journal of Cryptology. 28: 29-48. DOI: 10.1007/S00145-013-9167-4 |
0.509 |
|
2014 |
Bellare M, Ristov T. A Characterization of Chameleon Hash Functions and New, Efficient Designs Journal of Cryptology. 27: 799-823. DOI: 10.1007/S00145-013-9155-8 |
0.492 |
|
2012 |
Bellare M, Boldyreva A, Knudsen L, Namprempre C. On-line ciphers and the hash-CBC constructions Journal of Cryptology. 25: 640-679. DOI: 10.1007/S00145-011-9106-1 |
0.78 |
|
2009 |
Bellare M, Namprempre C, Neven G. Security proofs for identity-based identification and signature schemes Journal of Cryptology. 22: 1-61. DOI: 10.1007/S00145-008-9028-8 |
0.831 |
|
2008 |
Abdalla M, An JH, Bellare M, Namprempre C. From identification to signatures via the Fiat-Shamir transform: Necessary and sufficient conditions for security and forward-security Ieee Transactions On Information Theory. 54: 3631-3646. DOI: 10.1109/Tit.2008.926303 |
0.804 |
|
2008 |
Bellare M, Shoup S. Two-tier signatures from the Fiat-Shamir transform, with applications to strongly unforgeable and one-time signatures Iet Information Security. 2: 47-63. DOI: 10.1049/Iet-Ifs:20070089 |
0.644 |
|
2008 |
Abdalla M, Bellare M, Catalano D, Kiltz E, Kohno T, Lange T, Malone-Lee J, Neven G, Paillier P, Shi H. Searchable encryption revisited: Consistency properties, relation to anonymous IBE, and extensions Journal of Cryptology. 21: 350-391. DOI: 10.1007/S00145-007-9006-6 |
0.818 |
|
2007 |
Bellare M, Boldyreva A, Kurosawa K, Staddon J. Multirecipient encryption schemes: How to save on bandwidth and computation without sacrificing security Ieee Transactions On Information Theory. 53: 3927-3943. DOI: 10.1109/Tit.2007.907471 |
0.817 |
|
2006 |
Bellare M, Palacio A. Protecting against key-exposure: strongly key-insulated encryption with optimal threshold Applicable Algebra in Engineering, Communication and Computing. 16: 379-396. DOI: 10.1007/S00200-005-0183-Y |
0.808 |
|
2005 |
Bellare M, Neven G. Transitive signatures: new schemes and proofs Ieee Transactions On Information Theory. 51: 2133-2151. DOI: 10.1109/Tit.2005.847697 |
0.648 |
|
2004 |
Bellare M, Kohno T, Namprempre C. Breaking and provably repairing the SSH authenticated encryption scheme: A case study of the encode-then-encrypt-and-MAC paradigm Acm Transactions On Information and System Security. 7: 206-241. DOI: 10.1145/996943.996945 |
0.817 |
|
2003 |
Rogaway P, Bellare M, Black J. OCB: A block-cipher mode of operation for efficient authenticated encryption Acm Transactions On Information and System Security. 6: 365-403. DOI: 10.1145/937527.937529 |
0.793 |
|
2003 |
Bellare M, Namprempre C, Pointcheval D, Semanko M. The one-more-RSA-inversion problems and the security of chaum's blind signature scheme Journal of Cryptology. 16: 185-215. DOI: 10.1007/S00145-002-0120-1 |
0.761 |
|
2000 |
Bellare M, Garay JA, Hauser R, Herzberg A, Krawczyk H, Steiner M, Tsudik G, Van Herreweghen E, Waidner M. Design, implementation, and deployment of the iKP secure electronic payment system Ieee Journal On Selected Areas in Communications. 18: 611-627. DOI: 10.1109/49.839936 |
0.511 |
|
2000 |
Bellare M, Namprempre C. Authenticated encryption: Relations among notions and analysis of the generic composition paradigm Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 1976: 517-530. DOI: 10.1007/S00145-008-9026-X |
0.831 |
|
2000 |
Bellare M, Kilian J, Rogaway P. The Security of the Cipher Block Chaining Message Authentication Code Journal of Computer and System Sciences. 61: 362-399. DOI: 10.1006/Jcss.1999.1694 |
0.747 |
|
1999 |
Bellare M, Rivest RL. Translucent Cryptography -- An Alternative to Key Escrow and its Implementation via Fractional Oblivious Transfer Journal of Cryptology. 12: 117-139. DOI: 10.1007/Pl00003819 |
0.513 |
|
1998 |
Bellare M, Goldreich O, Sudan M. Free Bits, PCPs, and Nonapproximability---Towards Tight Results Siam Journal On Computing. 27: 804-915. DOI: 10.1137/S0097539796302531 |
0.326 |
|
1996 |
Bellare M, Yung M. Certifying Permutations: Noninteractive zero-knowledge based on any trapdoor permutation Journal of Cryptology. 9: 149-166. DOI: 10.1007/Bf00208000 |
0.361 |
|
1995 |
Bellare M, Rogaway P. The complexity of approximating a nonlinear program Mathematical Programming. 69: 429-441. DOI: 10.1007/Bf01585569 |
0.709 |
|
1993 |
Bellare M, Goldreich O, Goldwasser S. Randomness in interactive proofs Computational Complexity. 3: 319-354. DOI: 10.1007/Bf01275487 |
0.307 |
|
1992 |
Bellare M, Micali S. How to sign given any trapdoor permutation Journal of the Acm. 39: 214-233. DOI: 10.1145/147508.147537 |
0.828 |
|
Show low-probability matches. |