Indiana University School of Informatics

Skip directly to: page content

Skip directly to : top of page

Markus Jakobsson

Papers

Papers / Efficiency

  • M. Jakobsson.
    "Fractal Hash Sequence Representation and Traversal."
    One-page abstract. In Proceedings of the 2002 IEEE International Symposium on Information Theory (ISIT `02). 2002. pp. 437--444.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ] [ Code ]

  • M. Jakobsson, A. Juels, and R. Rivest.
    "Making Mix Nets Robust For Electronic Voting By Randomized Partial Checking."
    In Proceedings of the 11th USENIX Security Symposium. USENIX Association, 2002. pp. 339--353.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ]

  • D. Coppersmith and M. Jakobsson.
    "Almost Optimal Hash Sequence Traversal."
    In Financial Crypto '02. 2002.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ] [ Code ]

  • M. Jakobsson.
    "Flash Mixing."
    In PODC '99. ACM Press, 1999. pp. 83--89.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ]

  • M. Jakobsson and A. Juels
    "Millimix: Mixing in Small Batches."
    DIMACS Technical Report 99-33, 1999.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ]

  • M. Jakobsson and C-P Schnorr.
    "Efficient Oblivious Proofs of Correct Exponentiation."
    In CMS '99. IFIP Conference Proceedings, Vol. 152. Kluwer, B.V., 1999. pp. 71--86.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ]

  • M. Jakobsson.
    "Reducing costs in identification protocols."
    Rump Session, InCrypto '92, 1992.
    [ Abstract ] [ Ps, Pdf] [ BiBTeX ]


Skip directly to : top of page