High-precision secure computation of satellite collision probabilities
From MaRDI portal
Recommendations
Cites work
- A new approach to practical active-secure two-party computation
- A proof of security of Yao's protocol for two-party computation
- Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing
- Advances in Cryptology - CRYPTO 2003
- Asynchronous Multiparty Computation: Theory and Implementation
- Cryptocomputing with rationals
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Efficient non-interactive secure computation
- Foundations of Cryptography
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Garbled RAM revisited
- High-precision secure computation of satellite collision probabilities
- How to garble RAM programs?
- How to share a secret
- scientific article; zbMATH DE number 3856987 (Why is no real title available?)
- scientific article; zbMATH DE number 1030984 (Why is no real title available?)
- scientific article; zbMATH DE number 1559560 (Why is no real title available?)
- scientific article; zbMATH DE number 3273551 (Why is no real title available?)
- Multiparty Computation from Somewhat Homomorphic Encryption
- On the power of correlated randomness in secure computation
- On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption
- Probabilistically correct secure arithmetic computation for modular conversion, zero test, comparison, MOD and exponentiation
- Secure Arithmetic Computation with No Honest Majority
- Semi-homomorphic encryption and multiparty computation
Cited in
(3)
This page was built for publication: High-precision secure computation of satellite collision probabilities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2827717)