Skip to main content

and
  1. Chapter and Conference Paper

    Revocation for Delegatable Anonymous Credentials

    This paper introduces and formalizes homomorphic proofs that allow ‘adding’ proofs and proof statements to get a new proof of the ‘sum’ statement. Additionally, we introduce a construction of homomorphic proofs, ...

    Tolga Acar, Lan Nguyen in Public Key Cryptography – PKC 2011 (2011)

  2. 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)

  3. No Access

    Article

    Montgomery Multiplication in GF(2k)

    We show that the multiplication operation c=a · b · r-1 in the field GF(2k can be implemented significantly faster in software than the standard multiplication, where r is a special fixed element of the field. Th...

    Cetin K. Koc, Tolga Acar in Designs, Codes and Cryptography (1998)