Skip to main content

and
  1. Article

    Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting

    The problem of generating an RSA composite in a distributed manner without leaking its factorization is particularly challenging and useful in many cryptographic protocols. Our first contribution is the first ...

    Carmit Hazay, Gert Læssøe Mikkelsen, Tal Rabin, Tomas Toft in Journal of Cryptology (2019)

  2. Chapter and Conference Paper

    Formal Treatment of Privacy-Enhancing Credential Systems

    Privacy-enhancing attribute-based credentials (PABCs) are the core ingredients to privacy-friendly authentication systems. They allow users to obtain credentials on attributes and prove possession of these creden...

    Jan Camenisch, Stephan Krenn, Anja Lehmann in Selected Areas in Cryptography – SAC 2015 (2016)

  3. No Access

    Chapter and Conference Paper

    Efficient Threshold Zero-Knowledge with Applications to User-Centric Protocols

    In this paper, we investigate on threshold proofs, a framework for distributing the prover’s side of interactive proofs of knowledge over multiple parties. Interactive proofs of knowledge (PoK) are widely used pr...

    Marcel Keller, Gert Læssøe Mikkelsen, Andy Rupp in Information Theoretic Security (2012)

  4. Chapter and Conference Paper

    Efficient, Robust and Constant-Round Distributed RSA Key Generation

    We present the first protocol for distributed RSA key generation which is constant round, secure against malicious adversaries and has a negligibly small bound on the error probability, even using only one ite...

    Ivan Damgård, Gert Læssøe Mikkelsen in Theory of Cryptography (2010)