Year |
Citation |
Score |
2019 |
Dinur I, Dunkelman O, Keller N, Shamir A. Efficient Dissection of Bicomposite Problems with Cryptanalytic Applications Journal of Cryptology. 32: 1448-1490. DOI: 10.1007/S00145-018-9303-2 |
0.354 |
|
2015 |
Dinur I, Dunkelman O, Keller N, Shamir A. Reflections on slide with a twist attacks Designs, Codes, and Cryptography. DOI: 10.1007/S10623-015-0098-Y |
0.371 |
|
2015 |
Dinur I, Dunkelman O, Keller N, Shamir A. Key Recovery Attacks on Iterated Even–Mansour Encryption Schemes Journal of Cryptology. DOI: 10.1007/S00145-015-9207-3 |
0.384 |
|
2015 |
Andreeva E, Bouillaguet C, Dunkelman O, Fouque PA, Hoch J, Kelsey J, Shamir A, Zimmer S. New Second-Preimage Attacks on Hash Functions Journal of Cryptology. DOI: 10.1007/S00145-015-9206-4 |
0.392 |
|
2015 |
Biham E, Dunkelman O, Keller N, Shamir A. New Attacks on IDEA with at Least 6 Rounds Journal of Cryptology. 28: 209-239. DOI: 10.1007/S00145-013-9162-9 |
0.4 |
|
2015 |
Dunkelman O, Keller N, Shamir A. Improved Single-Key Attacks on 8-Round AES-192 and AES-256 Journal of Cryptology. 28: 397-422. DOI: 10.1007/S00145-013-9159-4 |
0.366 |
|
2014 |
Dinur I, Dunkelman O, Keller N, Shamir A. Dissection: A new paradigm for solving bicomposite search problems Communications of the Acm. 57: 98-105. DOI: 10.1145/2661434 |
0.307 |
|
2014 |
Dunkelman O, Keller N, Shamir A. Almost universal forgery attacks on AES-based MAC’s Designs, Codes, and Cryptography. 76: 431-449. DOI: 10.1007/S10623-014-9969-X |
0.36 |
|
2014 |
Dodis Y, Shamir A, Stephens-Davidowitz N, Wichs D. How to eat your entropy and have it too - Optimal recovery strategies for compromised RNGs Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 8617: 37-54. DOI: 10.1007/S00453-016-0239-3 |
0.366 |
|
2014 |
Dunkelman O, Keller N, Shamir A. A practical-time related-key attack on the KASUMI cryptosystem used in GSM and 3G telephony Journal of Cryptology. 27: 824-849. DOI: 10.1007/S00145-013-9154-9 |
0.337 |
|
2014 |
Dinur I, Dunkelman O, Shamir A. Improved practical attacks on round-reduced Keccak Journal of Cryptology. 27: 183-209. DOI: 10.1007/S00145-012-9142-5 |
0.36 |
|
2013 |
Dunkelman O, Keller N, Shamir A. Slidex Attacks on the Even–Mansour Encryption Scheme Journal of Cryptology. 28: 1-28. DOI: 10.1007/S00145-013-9164-7 |
0.411 |
|
2012 |
Dinur I, Shamir A. Applying cube attacks to stream ciphers in realistic scenarios Cryptography and Communications. 4: 217-232. DOI: 10.1007/S12095-012-0068-4 |
0.389 |
|
2011 |
Dolev S, Kopeetsky M, Shamir A. RFID Authentication Efficient Proactive Information Security within Computational Security Theory of Computing Systems. 48: 132-149. DOI: 10.1007/S00224-009-9236-0 |
0.37 |
|
2010 |
Biryukov A, Shamir A. Structural cryptanalysis of SASAS Journal of Cryptology. 23: 505-518. DOI: 10.1007/S00145-010-9062-1 |
0.344 |
|
2010 |
Tromer E, Osvik DA, Shamir A. Efficient cache attacks on AES, and countermeasures Journal of Cryptology. 23: 37-71. DOI: 10.1007/S00145-009-9049-Y |
0.337 |
|
2008 |
Phan RCW, Shamir A. Improved related-key attacks on DESX and DESX+ Cryptologia. 32: 13-22. DOI: 10.1080/01611190701743690 |
0.304 |
|
2006 |
Rivest RL, Shamir A, Tauman Y. How to leak a secret: theory and applications of ring signatures Theoretical Computer Science. 3895: 164-186. DOI: 10.1007/11685654_7 |
0.34 |
|
2002 |
Shamir A, Tsaban B. Guaranteeing the diversity of number generators Information & Computation. 171: 350-363. DOI: 10.1006/Inco.2001.3045 |
0.335 |
|
1999 |
Feige U, Lapidot D, Shamir A. Multiple noninteractive zero knowledge proofs under general assumptions Siam Journal On Computing. 29: 1-28. DOI: 10.1137/S0097539792230010 |
0.585 |
|
1995 |
Lapidot D, Shamir A. A one-round, two-prover, zero-knowledge protocol for NP Combinatorica. 15: 203-214. DOI: 10.1007/Bf01200756 |
0.365 |
|
1993 |
Feldman D, Impagliazzo R, Naor M, Nisan N, Rudich S, Shamir A. On Dice and Coins: Models of Computation for Random Generation Information and Computation. 104: 159-174. DOI: 10.1006/Inco.1993.1028 |
0.315 |
|
1992 |
Shamir A. Ip = Pspace Journal of the Acm. 39: 869-877. DOI: 10.1145/146585.146609 |
0.333 |
|
1992 |
Feige U, Shamir A. Multi-oracle interactive protocols with constant space verifiers Journal of Computer and System Sciences. 44: 259-271. DOI: 10.1016/0022-0000(92)90021-A |
0.574 |
|
1989 |
Fiat A, Shamir A. How to find a battleship Networks. 19: 361-371. DOI: 10.1002/Net.3230190306 |
0.613 |
|
1988 |
Feige U, Fiat A, Shamir A. Zero-knowledge proofs of identity Journal of Cryptology. 1: 77-94. DOI: 10.1007/Bf02351717 |
0.676 |
|
1986 |
Fiat A, Shamir A. Polymorphic arrays: A novel VLSI layout for systolic computers Journal of Computer and System Sciences. 33: 47-65. DOI: 10.1016/0022-0000(86)90042-5 |
0.638 |
|
1984 |
Shamir A. A polynomial-time algorithm for breaking the basic Merkle - Hellman cryptosystem Ieee Transactions On Information Theory. 30: 699-704. DOI: 10.1109/Tit.1984.1056964 |
0.319 |
|
1984 |
Shamir A, Schnorr CP. Cryptanalysis of certain variants of Rabin's signature scheme Information Processing Letters. 19: 113-115. DOI: 10.1016/0020-0190(84)90088-7 |
0.359 |
|
1983 |
Rivest RL, Shamir A, Adleman L. A method for obtaining digital signatures and public-key cryptosystems Communications of the Acm. 26: 96-99. DOI: 10.1145/357980.358017 |
0.344 |
|
1983 |
Shamir A. On the generation of cryptographically strong pseudorandom sequences Acm Transactions On Computer Systems. 1: 38-44. DOI: 10.1145/357353.357357 |
0.334 |
|
1979 |
Shamir A. How to share a secret Communications of the Acm. 22: 612-613. DOI: 10.1145/359168.359176 |
0.352 |
|
1978 |
Manna Z, Shamir A. The convergence of functions to fixedpoints of recursive definitions Theoretical Computer Science. 6: 109-141. DOI: 10.1016/0304-3975(78)90033-6 |
0.571 |
|
1977 |
Manna Z, Shamir A. The Optimal Approach to Recursive Programs Communications of the Acm. 20: 824-831. DOI: 10.1145/359863.359885 |
0.563 |
|
1976 |
Manna Z, Shamir A. The Theoretical Aspects of the Optimal Fixedpoint Siam Journal On Computing. 5: 414-426. DOI: 10.1137/0205033 |
0.579 |
|
Show low-probability matches. |