Delegating a Pairing Can Be Both Secure and Efficient-Reference-Cited by-同舟云学术

Delegating a Pairing Can Be Both Secure and Efficient

Published:2014 Issue: Volume: Page:549-565
ISSN:0302-9743
Container-title:Applied Cryptography and Network Security
language:
Short-container-title:

Author:

Canard Sébastien,Devigne Julien,Sanders Olivier

Publisher

Springer International Publishing

Link

http://link.springer.com/content/pdf/10.1007/978-3-319-07536-5_32

Reference32 articles.

1. Paulo, S.L.M., Barreto, S.D., Galbraith, C.O.: hEigeartaigh, and Michael Scott. Efficient pairing computation on supersingular abelian varieties. IACR Cryptology ePrint Archive, 375 (2004)

2. Lecture Notes in Computer Science;P.S.L.M. Barreto,2002

3. Lecture Notes in Computer Science;P.S.L.M. Barreto,2004

4. Lecture Notes in Computer Science;P.S.L.M. Barreto,2006

5. David Bernhard, Georg Fuchsbauer, Essam Ghadafi, Nigel P. Smart, and Bogdan Warinschi. Anonymous attestation with user-controlled linkability. IACR Cryptology ePrint Archive, 658 (2011)

Cited by 30 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Single-Server Batch Delegation of Variable-Input Pairings with Unbounded Client Lifetime;Lecture Notes in Computer Science;2024

2. On Single-Server Delegation Without Precomputation;Proceedings of the 20th International Conference on Security and Cryptography;2023

3. On Single-Server Delegation of RSA;Innovative Security Solutions for Information Technology and Communications;2023

4. Single-Server Delegation of Small-Exponent Exponentiation from Quasilinear-Time Clients and Applications;Proceedings of the 4th Workshop on CPS & IoT Security and Privacy;2022-11-07

5. On The Batch Outsourcing Of Pairing Computations;The Computer Journal;2022-07-24