Commuting Signatures and Verifiable Encryption and an Application to Non-Interactively Delegatable Credentials

Download Now Date Added: Apr 2010
Format: PDF

Verifiable encryption allows to encrypt a signature and prove that the plaintext is valid. The authors introduce a new primitive called commuting signature that extends verifiable encryption in multiple ways: a signer can encrypt both signature and message and prove validity; more importantly, given a ciphertext, a signer can create a verifiably encrypted signature on the encrypted message; thus signing and encrypting commute. They instantiate commuting signatures using the proof system by Groth and Sahai (EUROCRYPT '08) and the automorphic signatures by Fuchsbauer (ePrint report 2009/320). As an application, they give an instantiation of delegatable anonymous credentials, a powerful primitive introduced by Belenkiy et al. (CRYPTO '09).