Sign In

Login

Password

Forgot Password ? Sign Up

Malleability (cryptography) (English Wikipedia)

Analysis of information sources in references of the Wikipedia article "Malleability (cryptography)" in English language version.

refsWebsite
Global rank English rank
3doi.org
2nd place
2nd place
2psu.edu
207th place
136th place
1archive.org
6th place
6th place

archive.org (Global: 6th place; English: 6th place)

doi.org (Global: 2nd place; English: 2nd place)

  • Dolev, Danny; Dwork, Cynthia; Naor, Moni (2000). "Nonmalleable Cryptography". SIAM Journal on Computing. 30 (2): 391–437. CiteSeerX 10.1.1.49.4643. doi:10.1137/S0097539795291562.
  • Bellare, Mihir; Desai, Anand; Pointcheval, David; Rogaway, Phillip (1998-08-23). Krawczyk, Hugo (ed.). Relations among notions of security for public-key encryption schemes. Lecture Notes in Computer Science. Springer Berlin Heidelberg. pp. 26–45. doi:10.1007/bfb0055718. ISBN 978-3540648925. {{cite book}}: |work= ignored (help)
  • Fischlin, Marc (2005-07-11). "Completely Non-malleable Schemes". Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 3580. Springer, Berlin, Heidelberg. pp. 779–790. CiteSeerX 10.1.1.501.6445. doi:10.1007/11523468_63. ISBN 9783540275800.

psu.edu (Global: 207th place; English: 136th place)

citeseerx.ist.psu.edu

  • Dolev, Danny; Dwork, Cynthia; Naor, Moni (2000). "Nonmalleable Cryptography". SIAM Journal on Computing. 30 (2): 391–437. CiteSeerX 10.1.1.49.4643. doi:10.1137/S0097539795291562.
  • Fischlin, Marc (2005-07-11). "Completely Non-malleable Schemes". Automata, Languages and Programming. Lecture Notes in Computer Science. Vol. 3580. Springer, Berlin, Heidelberg. pp. 779–790. CiteSeerX 10.1.1.501.6445. doi:10.1007/11523468_63. ISBN 9783540275800.