New techniques for non-interactive shuffle and range arguments

González, Alfonso; Ràfols, Carla

doi:https://doi.org/10.1007/978-3-319-39555-5_23

New techniques for non-interactive shuffle and range arguments

Citation

González A, Ráfols C. New techniques for non-interactive shuffle and range arguments. In: Manulis M, Sadeghi AR, Schneider S, editors. Applied Cryptography and Network Security. 14th International Conference ACNS 2016 Proceedings. 2016 Jun 19-22; Guildford, UK. Cham: Springer; 2016. p. 427-44. (LNCS; no. 9.696). DOI: 10.1007/978-3-319-39555-5_23

Abstract

We construct the most efficient non-interactive Argument of Correctness of a Shuffle and Range Argument under falsifiable assumptions in asymmetric bilinear groups. Our constructions use as a common building block a novel quasi-adaptive argument for proving that n commitments open to messages in a public set S, with proof-size independent of n.