Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves
Author(s): Boneh, Dan; Glass, Darren; Krashen, Daniel; Lauter, Kristin; Sharif, Shahed; et al
DownloadTo refer to this page use:
http://arks.princeton.edu/ark:/88435/pr1qg1p
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Boneh, Dan | - |
dc.contributor.author | Glass, Darren | - |
dc.contributor.author | Krashen, Daniel | - |
dc.contributor.author | Lauter, Kristin | - |
dc.contributor.author | Sharif, Shahed | - |
dc.contributor.author | Silverberg, Alice | - |
dc.contributor.author | Tibouchi, Mehdi | - |
dc.contributor.author | Zhandry, Mark | - |
dc.date.accessioned | 2021-10-08T19:48:14Z | - |
dc.date.available | 2021-10-08T19:48:14Z | - |
dc.date.issued | 2020 | en_US |
dc.identifier.citation | Boneh, Dan, Darren Glass, Daniel Krashen, Kristin Lauter, Shahed Sharif, Alice Silverberg, Mehdi Tibouchi, and Mark Zhandry. "Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves." Journal of Mathematical Cryptology 14, no. 1 (2020): 5-14. doi:10.1515/jmc-2015-0047 | en_US |
dc.identifier.issn | 1862-2976 | - |
dc.identifier.uri | http://arks.princeton.edu/ark:/88435/pr1qg1p | - |
dc.description.abstract | We describe a framework for constructing an efficient non-interactive key exchange (NIKE) protocol for n parties for any n ≥ 2. Our approach is based on the problem of computing isogenies between isogenous elliptic curves, which is believed to be difficult. We do not obtain a working protocol because of a missing step that is currently an open mathematical problem. What we need to complete our protocol is an efficient algorithm that takes as input an abelian variety presented as a product of isogenous elliptic curves, and outputs an isomorphism invariant of the abelian variety. Our framework builds a cryptographic invariant map, which is a new primitive closely related to a cryptographic multilinear map, but whose range does not necessarily have a group structure. Nevertheless, we show that a cryptographic invariant map can be used to build several cryptographic primitives, including NIKE, that were previously constructed from multilinear maps and indistinguishability obfuscation. | en_US |
dc.format.extent | 5 - 14 | en_US |
dc.language.iso | en_US | en_US |
dc.relation.ispartof | Journal of Mathematical Cryptology | en_US |
dc.rights | Final published version. This is an open access article. | en_US |
dc.title | Multiparty Non-Interactive Key Exchange and More From Isogenies on Elliptic Curves | en_US |
dc.type | Journal Article | en_US |
dc.identifier.doi | 10.1515/jmc-2015-0047 | - |
dc.identifier.eissn | 1862-2984 | - |
pu.type.symplectic | http://www.symplectic.co.uk/publications/atom-terms/1.0/journal-article | en_US |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
MultipartyNonInteractiveKeyExchange.pdf | 444.77 kB | Adobe PDF | View/Download |
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.