Secure delegation of group exponentiations: Efficient and fully verifiable schemes with two servers-Reference-Cited by-同舟云学术

Secure delegation of group exponentiations: Efficient and fully verifiable schemes with two servers

Published:2019-05-08 Issue: Volume: Page:e70
ISSN:2475-6725
Container-title:Security and Privacy
language:en
Short-container-title:Security and Privacy

Author:

Moritz Stephan¹,Uzunkol Osmanbey¹²^ORCID

Affiliation:

1. Faculty of Mathematics and Computer ScienceFernUniversität in Hagen Hagen Germany

2. Faculty 3 Information and CommunicationFlensburg University of Applied Sciences Flensburg Germany

Publisher

Wiley

Link

https://onlinelibrary.wiley.com/doi/pdf/10.1002/spy2.70

Reference25 articles.

1. MoritzS UzunkolOA. More Efficient secure fully verifiable delegation scheme for simultaneous group exponentiations. Paper presented at: Intelligent Secure and Dependable Systems in Distributed and Cloud Environments ISDDC 2018 LCNS. Springer International Publishing;2018:74–93.

2. YaoA. Protocols for secure computations. Paper presented at: 23rd Annual Symposium on Foundations of Computer Science FOCS '82;1982:160–164.

3. Proceedings of the Forty‐First Annual ACM Symposium on Theory of Computing STOC '09 2009 ACM New York NY C Gentry Fully homomorphic encryption using ideal lattices 169 178

4. HohenbergerS LysyanskayaA. How to securely outsource cryptographic computations. Paper presented at: Theory of Cryptography Second Theory of Cryptography Conference TCC 2005; February 10–12 2005 Cambridge MA. LCNS 3378. Springer;2005:264–282.

5. ChenX LiJ MaJ TangQ LouW. New algorithms for secure outsourcing of modular exponentiations. Paper presented at: Computer Security ‐ ESORICS 2012 ‐ 17th European Symposium on Research in Computer Security; September 10–12 2012 Pisa Italy LCNS 7459. Springer;2012:541–556.