Skip to main content

4 Result(s)

within Mira Belenkiy Remove this filter

and

  1. Chapter and Conference Paper

    Cryptographic Agility and Its Relation to Circular Encryption

    We initiate a provable-security treatment of cryptographic agility. A primitive (for example PRFs, authenticated encryption schemes or digital signatures) is agile when multiple, individually secure schemes can s...

    Tolga Acar, Mira Belenkiy, Mihir Bellare… in Advances in Cryptology – EUROCRYPT 2010 (2010)

    Download PDF (307 KB)

  2. Chapter and Conference Paper

    Randomizable Proofs and Delegatable Anonymous Credentials

    We construct an efficient delegatable anonymous credentials system. Users can anonymously and unlinkably obtain credentials from any authority, delegate their credentials to other users, and prove possession o...

    Mira Belenkiy, Jan Camenisch, Melissa Chase… in Advances in Cryptology - CRYPTO 2009 (2009)

    Download PDF (291 KB)

  3. No Access

    Chapter and Conference Paper

    Compact E-Cash and Simulatable VRFs Revisited

    Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing product equations (Eurocrypt 2008) to ...

    Mira Belenkiy, Melissa Chase… in Pairing-Based Cryptography – Pairing 2009 (2009)

  4. Chapter and Conference Paper

    P-signatures and Noninteractive Anonymous Credentials

    In this paper, we introduce P-signatures. A P-signature scheme consists of a signature scheme, a commitment scheme, and (1) an interactive protocol for obtaining a signature on a committed value; (2) a non − inte...

    Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, Anna Lysyanskaya in Theory of Cryptography (2008)

    Download PDF (516 KB)