Anonymous Single-Round Server-Aided Verification
Paper i proceeding, 2019

Server-Aided Verification (SAV) is a method that can be em- ployed 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.

Digital Signatures

Verifiable Delegation

Server-Aided Computations

Författare

Aikaterini Mitrokotsa

Chalmers, Data- och informationsteknik, Nätverk och system

Elena Pagnin

Chalmers, Data- och informationsteknik, Nätverk och system

Keisuke Tanaka

Tokyo Institute of Technology

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

03029743 (ISSN) 16113349 (eISSN)

Vol. 11368 LNCS 23-43

5th International Conference on on Cryptology and Information Security (LATINCRYPT)
La Havana, Cuba,

Ämneskategorier

Annan data- och informationsvetenskap

Datavetenskap (datalogi)

Datorsystem

DOI

10.1007/978-3-030-25283-0_2

Mer information

Senast uppdaterat

2024-07-22