TY - CPAPER
KW - supersingular isogeny cryptography
KW - lightweight cryptography
KW - post-quantum cryptographic protocols
KW - secure computation outsourcing
AU - Robi Pedersen
AU - Osmanbey Uzunkol
AB - We address the problem of speeding up isogeny computation for supersingular elliptic curves over finite fields using untrusted computational resources like third party servers or cloud service providers (CSPs). We first propose new, efficient and secure delegation schemes. This especially enables resource-constrained devices (e.g. smart cards, RFID tags, tiny sensor nodes) to effectively deploy post-quantum isogeny-based cryptographic protocols. To the best of our knowledge, these new schemes are the first attempt to generalize the classical secure delegation schemes for group exponentiations and pairing computation to an isogeny-based post-quantum setting. Then, we apply these secure delegation subroutines to improve the performance of supersingular isogeny-based zero-knowledge proofs of identity. Our experimental results show that, at the 128-bit quantum-security level, the proving party only needs about 3% of the original protocol cost, while the verifying party s effort is fully reduced to comparison operations. Lastly, we also apply our delegation schemes to decrease the computational cost of the decryption step for the NIST postquantum standardization candidate SIKE.
BT - Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop
CY - New York, NY, USA
DO - 10.1145/3338466.3358913
N2 - We address the problem of speeding up isogeny computation for supersingular elliptic curves over finite fields using untrusted computational resources like third party servers or cloud service providers (CSPs). We first propose new, efficient and secure delegation schemes. This especially enables resource-constrained devices (e.g. smart cards, RFID tags, tiny sensor nodes) to effectively deploy post-quantum isogeny-based cryptographic protocols. To the best of our knowledge, these new schemes are the first attempt to generalize the classical secure delegation schemes for group exponentiations and pairing computation to an isogeny-based post-quantum setting. Then, we apply these secure delegation subroutines to improve the performance of supersingular isogeny-based zero-knowledge proofs of identity. Our experimental results show that, at the 128-bit quantum-security level, the proving party only needs about 3% of the original protocol cost, while the verifying party s effort is fully reduced to comparison operations. Lastly, we also apply our delegation schemes to decrease the computational cost of the decryption step for the NIST postquantum standardization candidate SIKE.
PB - Association for Computing Machinery
PP - New York, NY, USA
PY - 2019
SN - 9781450368261
EP - 29–42
T2 - Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security Workshop
TI - Secure Delegation of Isogeny Computations and Cryptographic Applications
UR - https://doi.org/10.1145/3338466.3358913
ER -