Cryptology ePrint Archive: Report 2017/794

Anonymous Single-Round Server-Aided Verification

Elena Pagnin and Aikaterini Mitrokotsa and Keisuke Tanaka

Abstract: Server-Aided Verification (SAV) is a method that can be employed to speed up the process of verifying signatures by letting the verifier outsource part of its computation load to a third party. Achieving fast and reliable verification under the presence of an untrusted server is an attractive goal in cloud computing and internet of things scenarios. In this paper, we describe a simple framework for SAV where the interaction between a verifier and an untrusted server happens via a single-round protocol. We propose a security model for SAV that refines existing ones and includes the new notions of SAV-anonymity and extended unforgeability. In addition, we apply our definitional framework to provide the first generic transformation from any signature scheme to a single-round SAV scheme that incorporates verifiable computation. Our compiler identifies two independent ways to achieve SAV-anonymity: computationally, through the privacy of the verifiable computation scheme, or unconditionally, through the adaptibility of the signature scheme. Finally, we define three novel instantiations of SAV schemes obtained through our compiler. Compared to previous works, our proposals are the only ones which simultaneously achieve existential unforgeability and soundness against collusion.

Category / Keywords: public-key cryptography / Server-Aided Verification, Digital Signatures, Anonymity, Verifiable Computation

Original Publication (with major differences): Latincrypt 2017

Date: received 21 Aug 2017

Contact author: elenap at chalmers se

Available format(s): PDF | BibTeX Citation

Version: 20170825:190948 (All versions of this report)

Short URL: ia.cr/2017/794

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]