RT Conference Proceedings
T1 A new cramer-shoup like methodology for group based provably secure encryption schemes
A1 González Vasco, María Isabel
A1 Martínez, Consuelo
A1 Steinwandt, Rainer
A1 Villar, Jorge L.
AB 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).
PB Springer
SN 978-3-540-24573-5
YR 2005
FD 2005
LK https://hdl.handle.net/10016/37415
UL https://hdl.handle.net/10016/37415
LA eng
NO Proceedings of: TCC 2005: Theory of Cryptography Conference, 10-12 February 2005, Cambridge, MA, USA.
DS e-Archivo
RD 17 jul. 2024