Publication: A new cramer-shoup like methodology for group based provably secure encryption schemes
Loading...
Identifiers
Publication date
2005
Defense date
Advisors
Tutors
Journal Title
Journal ISSN
Volume Title
Publisher
Springer
Impact
Export
Abstract
A theoretical framework for the design of - in the sense of IND-CCA - provably secure public key cryptosystems taking non-abelian groups as a base is given. Our construction is inspired by Cramer and Shoup's general framework for developing secure encryption schemes from certain language membership problems; thus all our proofs are in the standard model, without any idealization assumptions. The skeleton we present is conceived as a guiding tool towards the construction of secure concrete schemes from finite non-abelian groups (although it is possible to use it also in conjunction with finite abelian groups).
Description
Proceedings of: TCC 2005: Theory of Cryptography Conference, 10-12 February 2005, Cambridge, MA, USA.
Keywords
Automorphism group, Encryption scheme, Braid group, Cryptographic primitive, Hash family
Bibliographic citation
González Vasco, M. I., Martínez, C., Steinwandt, R. & Villar, J. L. (10-12 February 2005). A new cramer-shoup like methodology for group based provably secure encryption schemes [proceedings]. In Theory of Cryptography: Second Theory of Cryptography. Conference, TCC 2005. Cambridge, MA, USA. Part of the Lecture Notes in Computer Science book series (LNSC,volume 3378).