Pages that link to "Item:Q2491304"
From MaRDI portal
The following pages link to Speeding up exponentiation using an untrusted computational resource (Q2491304):
Displaying 9 items.
- How to securely outsource the extended Euclidean algorithm for large-scale polynomials over finite fields (Q1999182) (← links)
- Delegating a product of group exponentiations with application to signature schemes (Q2025335) (← links)
- Lattice-based weak-key analysis on single-server outsourcing protocols of modular exponentiations and basic countermeasures (Q2040024) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
- CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)
- Yao’s Millionaires’ Problem and Public-Key Encryption Without Computational Assumptions (Q5357508) (← links)
