Adaptive Pseudo-free Groups and Applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Adaptive Pseudo-free Groups and Applications


In this paper we explore a powerful extension of the notion of pseudo-free groups, proposed by Rivest at TCC 2004. We identify, motivate, and study pseudo-freeness in face of adaptive adversaries who may learn solutions to other non-trivial equations before having to solve a new non-trivial equation. We present a novel, carefully crafted definition of adaptive pseudo-freeness that walks a fine line between being too weak and being unsatisfiable. We show that groups that satisfy our definition yield, via a generic construction, digital and network coding signature schemes. Finally, we obtain concrete constructions of such schemes in the RSA group by showing this group to be adaptive pseudo-free. In particular, we demonstrate the generality of our framework for signatures by showing that most existing schemes are instantiations of our generic construction.

Dates and versions

hal-01110376 , version 1 (28-01-2015)



Dario Catalano, Dario Fiore, Bogdan Warinschi. Adaptive Pseudo-free Groups and Applications. EUROCRYPT 2011 - 30th Annual International Conference on the Theory and Applications of Cryptographic Techniques, May 2011, Talinn, Estonia. pp.207-233, ⟨10.1007/978-3-642-20465-4_13⟩. ⟨hal-01110376⟩
971 View
0 Download



Gmail Facebook X LinkedIn More