Abstract
A protocol compiler is described, that transforms any provably secure authenticated 2-party key establishment into a provably secure authenticated group key establishment with 2 more rounds of communication. The compiler introduces neither idealizing assumptions nor high-entropy secrets, e.g., for signing. In particular, applying the compiler to a password-authenticated 2-party key establishment without random oracle assumption, yields a password-authenticated group key establishment without random oracle assumption. Our main technical tools are non-interactive and non-malleable commitment schemes that can be implemented in the common reference string (CRS) model. © International Association for Cryptologic Research 2007.
Author supplied keywords
Cite
CITATION STYLE
Abdalla, M., Bohli, J. M., Vasco, M. I. G., & Steinwandt, R. (2007). (Password) authenticated key establishment: From 2-party to group. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4392 LNCS, pp. 499–514). Springer Verlag. https://doi.org/10.1007/978-3-540-70936-7_27
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
