Cryptography

Protocols

  1. Gregory V. Bard, The application of polynomials over the field of two elements to a problem in intellectual property, IACR (2009), 6 pages.[eprint]
  2. S. T. Dougherty, S. Mesnager, and P. Sole, Secret-sharing schemes based on self-dual codes, Information Theory Workshop, 2008. ITW '08. IEEE (2008), 338-342.[doi]
  3. Greg Gamble, Barbara M. Macnhaut, Jennifer Seberry, and Anne Penfold Street, Further results on strongbox secured secret sharing schemes, Util. Math. 66 (2004), 165–193.[MR]
  4. Shuhui Hou, Tetsutaro Uehara, Yoshitaka Morimura, and Michihiko Minoh, Fingerprinting codes for live pay-television broadcast via internet, Multimedia Content Analysis and Mining, Lecture Notes in Computer Science, vol. 4577/2007, Springer Berlin / Heidelberg, 2007, pp. 252–261.
  5. David Jao and Kayo Yoshida, Boneh-Boyen signatures and the strong Diffie-Hellman problem, IACR (2009), 24 pages.[eprint]
  6. Antoine Joux, Reynald Lercier, David Naccache, and Emmanuel Thomé, Oracle-assisted static Diffie-Hellman is easier than discrete logarithms, IACR (2008).[eprint]
  7. Kerem Kaskaloglu and Ferruh Özbudak, A simple scheme for hierarchical threshold access structures, IACR (2009), 8.[eprint]
  8. Matthias Krause and Dirk Stegemann, More on the security of linear RFID authentication protocols, Selected Areas in Cryptography, Lecture Notes in Comput. Sci., vol. 5867, Springer, Berlin, 2009, pp. 182–196.[doi]
  9. Sihem Mesnager, P. Solé, and Steven T. Dougherty, Secret sharing schemes based on self-dual codes, Information Theory Workshop, 2008. ITW '08. IEEE (2008), 338–342.
  10. Rainer Steinwandt and Viktória I. Villányi, A one-time signature using run-length encoding, Inform. Process. Lett. 108 (2008), no. 4, 179–185.[MR]
  11. Suratose Tritilanunt, Colin Boyd, Ernest Foo, and Juan Manuel González Nieto, Toward non-parallelizable client puzzles, Cryptology and Network Security, Lecture Notes in Computer Science, vol. 4856/2007, Springer, Berlin/Heidelberg, 2007, pp. 247–264.