The following pages link to Theory of Cryptography (Q5711647):
Displaying 30 items.
- Efficient algorithms for secure outsourcing of bilinear pairings (Q476851) (← links)
- Secure outsourcing of cryptographic circuits manufacturing (Q1616639) (← links)
- 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)
- Comment on ``Practical and secure outsourcing algorithms for solving quadratic congruences in Internet of Things'' (Q2043368) (← links)
- Delegating supersingular isogenies over \(\mathbb{F}_{p^2}\) with cryptographic applications (Q2104421) (← links)
- A survey on delegated computation (Q2163976) (← links)
- Reusing nonces in Schnorr signatures (and keeping it secure...) (Q2167718) (← links)
- Efficient and secure delegation of exponentiation in general groups to a single malicious server (Q2209264) (← links)
- Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions (Q2223693) (← links)
- Secure and efficient delegation of elliptic-curve pairing (Q2229264) (← links)
- Publicly verifiable databases with efficient insertion/deletion operations (Q2396817) (← links)
- Secure outsourcing of modular exponentiations under single untrusted programme model (Q2403228) (← links)
- Speeding up exponentiation using an untrusted computational resource (Q2491304) (← links)
- Blockchain-based system for secure outsourcing of bilinear pairings (Q2663527) (← links)
- Toward Generic Method for Server-Aided Cryptography (Q2920981) (← links)
- Hosting Services on an Untrusted Cloud (Q2948391) (← links)
- Self-correctors for Cryptographic Modules (Q3104690) (← links)
- CRT-Based Outsourcing Algorithms for Modular Exponentiations (Q3179478) (← links)
- Error-Tolerant Combiners for Oblivious Primitives (Q3519523) (← links)
- Thrackles: An Improved Upper Bound (Q4625109) (← links)
- Outsourced Privacy-Preserving Random Decision Tree Algorithm Under Multiple Parties for Sensor-Cloud Integration (Q5056037) (← links)
- Cloud-Assisted LLL: A Secure and Efficient Outsourcing Algorithm for Approximate Shortest Vector Problem (Q5095931) (← links)
- Yao’s Millionaires’ Problem and Public-Key Encryption Without Computational Assumptions (Q5357508) (← links)
- Outsourcing Medical Dataset Analysis: A Possible Solution (Q5854429) (← links)
- Towards reducing delegation overhead in replication-based verification: an incentive-compatible rational delegation computing scheme (Q6086333) (← links)
- Hide the Modulus: A Secure Non-Interactive Fully Verifiable Delegation Scheme for Modular Exponentiations via CRT (Q6108841) (← links)
- DeCSIDH: delegating isogeny computations in the CSIDH setting (Q6157595) (← links)
- Encrypt-to-Self: Securely Outsourcing Storage (Q6485961) (← links)
