Efficient Ephemeral Elliptic Curve Cryptographic Keys

We show how any pair of authenticated users can on-the-fly agree on an elliptic curve group that is unique to their communication session, unpredictable to outside observers, and secure against known attacks. Our proposal is suitable for deployment on constrained devices such as smartphones, allowing them to efficiently generate ephemeral parameters that are unique to any single cryptographic application such as symmetric key agreement. For such applications it thus offers an alternative to long term usage of standardized or otherwise pre-generated elliptic curve parameters, obtaining security against cryptographic attacks aimed at other users, and eliminating the need to trust elliptic curves generated by third parties.


Editor(s):
Lopez, J
Mitchell, Cj
Published in:
Information Security Conference (ISC 2015), 9290, 524-547
Presented at:
18th International Conference on Information Security (ISC)
Year:
2015
Publisher:
Berlin, Springer-Verlag Berlin
ISBN:
978-3-319-23318-5
978-3-319-23317-8
Keywords:
Laboratories:




 Record created 2015-12-02, last modified 2018-05-05

n/a:
Download fulltext
PDF

Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)