Secure outsourcing of modular exponentiations under single untrusted programme model

DOI10.1016/j.jcss.2016.11.005zbMath1374.68067OpenAlexW2550617211WikidataQ62706015 ScholiaQ62706015MaRDI QIDQ2403228

Jun Ye, Kim-Kwang Raymond Choo, Yong Ding, Zheng Xu

Publication date: 15 September 2017

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2016.11.005

zbMATH Keywords

untrusted serversecure outsourcingmodular exponentiationshigh checkability

Mathematics Subject Classification ID

Cryptography (94A60) Data encryption (aspects in computer science) (68P25) Distributed systems (68M14)

Related Items

Efficient and secure delegation of exponentiation in general groups to a single malicious server, Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions, How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields, Delegating a product of group exponentiations with application to signature schemes, Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures

Cites Work

• Unnamed Item
• Unnamed Item
• On Schnorr's preprocessing for digital signature schemes
• Locally random reductions: Improvements and applications
• Self-testing/correcting with applications to numerical problems
• Speeding up exponentiation using an untrusted computational resource
• New Algorithms for Secure Outsourcing of Modular Exponentiations
• How to Delegate and Verify in Public: Verifiable Computation from Attribute-Based Encryption
• MuR-DPA: Top-Down Levelled Multi-Replica Merkle Hash Tree Based Secure Public Auditing for Dynamic Big Data Storage on Cloud
• Proximity-Aware Local-Recoding Anonymization with MapReduce for Scalable Big Data Privacy Preservation in Cloud
• Attribute-Based Signatures
• Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers
• Improved Delegation of Computation Using Fully Homomorphic Encryption
• Designing programs that check their work
• Fully homomorphic encryption using ideal lattices
• Memory Delegation
• Server-Aided Verification: Theory and Practice
• Server-Aided Verification Signatures: Definitions and New Constructions
• Theory of Cryptography