High-Precision Secure Computation of Satellite Collision Probabilities
暂无分享,去创建一个
Rafail Ostrovsky | Brett Hemenway | Steve Lu | IV WilliamWelser | R. Ostrovsky | Steve Lu | B. Hemenway | IV WilliamWelser
[1] Benny Pinkas,et al. Maturity and Performance of Programmable Secure Computation , 2016, IEEE Security & Privacy.
[2] Michael Hicks,et al. Wysteria: A Programming Language for Generic, Mixed-Mode Multiparty Computations , 2014, 2014 IEEE Symposium on Security and Privacy.
[3] Sander Siim,et al. Combining Secret Sharing and Garbled Circuits for Efficient Private IEEE 754 Floating-Point Computations , 2015, Financial Cryptography Workshops.
[4] Bo-Yin Yang,et al. Probabilistically Correct Secure Arithmetic Computation for Modular Conversion, Zero Test, Comparison, MOD and Exponentiation , 2012, SCN.
[5] Rafail Ostrovsky,et al. How to Garble RAM Programs , 2013, EUROCRYPT.
[6] Rafail Ostrovsky,et al. Efficient Non-interactive Secure Computation , 2011, EUROCRYPT.
[7] Salvatore Alfanol,et al. A Numerical Implementation of Spherical Object Collision Probability , 2005 .
[8] Adi Shamir,et al. Identity-Based Cryptosystems and Signature Schemes , 1984, CRYPTO.
[9] Andrew Chi-Chih Yao,et al. Protocols for Secure Computations (Extended Abstract) , 1982, FOCS.
[10] Avi Wigderson,et al. Completeness Theorems for Non-Cryptographic Fault-Tolerant Distributed Computation (Extended Abstract) , 1988, STOC.
[11] Oded Goldreich,et al. Foundations of Cryptography: List of Figures , 2001 .
[12] Claudio Orlandi,et al. A New Approach to Practical Active-Secure Two-Party Computation , 2012, IACR Cryptol. ePrint Arch..
[13] Anat Paskin-Cherniavsky,et al. On the Power of Correlated Randomness in Secure Computation , 2013, TCC.
[14] Robert Hall,et al. Advances in Satellite Conjunction Analysis , 2010 .
[15] Oded Goldreich,et al. Foundations of Cryptography: Basic Tools , 2000 .
[16] Yehuda Lindell,et al. A Proof of Security of Yao’s Protocol for Two-Party Computation , 2009, Journal of Cryptology.
[17] Ivan Damgård,et al. Asynchronous Multiparty Computation: Theory and Implementation , 2008, IACR Cryptol. ePrint Arch..
[18] Oded Goldreich,et al. Foundations of Cryptography: Volume 2, Basic Applications , 2004 .
[19] Brett Hemenway,et al. Achieving Higher-Fidelity Conjunction Analyses Using Cryptography to Improve Information Sharing , 2014 .
[20] Milton Abramowitz,et al. Handbook of Mathematical Functions with Formulas, Graphs, and Mathematical Tables , 1964 .
[21] Jan Willemson,et al. Secure floating point arithmetic and private satellite collision analysis , 2015, International Journal of Information Security.
[22] Dan Bogdanov,et al. Sharemind: A Framework for Fast Privacy-Preserving Computations , 2008, ESORICS.
[23] Mihir Bellare,et al. Efficient Garbling from a Fixed-Key Blockcipher , 2013, 2013 IEEE Symposium on Security and Privacy.
[24] Adi Shamir,et al. How to share a secret , 1979, CACM.
[25] Oded Goldreich. Foundations of Cryptography: Index , 2001 .
[26] Ahmad-Reza Sadeghi,et al. TASTY: tool for automating secure two-party computations , 2010, CCS '10.
[27] Abhi Shelat,et al. Billion-Gate Secure Computation with Malicious Adversaries , 2012, USENIX Security Symposium.
[28] Eul Gyu Im,et al. Malware analysis using visualized images and entropy graphs , 2015, International Journal of Information Security.
[29] Ivan Damgård,et al. Semi-Homomorphic Encryption and Multiparty Computation , 2011, IACR Cryptol. ePrint Arch..
[30] Vladimir Kolesnikov,et al. FleXOR: Flexible garbling for XOR gates that beats free-XOR , 2014, IACR Cryptol. ePrint Arch..
[31] S. Chevillard,et al. Computation of the error function erf in arbitrary precision with correct rounding , 2014 .
[32] Kartik Nayak,et al. ObliVM: A Programming Framework for Secure Computation , 2015, 2015 IEEE Symposium on Security and Privacy.
[33] Vladimir Kolesnikov,et al. Improved Garbled Circuit: Free XOR Gates and Applications , 2008, ICALP.
[34] Vinod Vaikuntanathan,et al. Efficient Fully Homomorphic Encryption from (Standard) LWE , 2011, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science.
[35] Yihua Zhang,et al. Secure Computation on Floating Point Numbers , 2013, NDSS.
[36] Vinod Vaikuntanathan,et al. On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption , 2012, STOC '12.
[37] Donald Beaver,et al. Precomputing Oblivious Transfer , 1995, CRYPTO.
[38] Ivan Damgård,et al. Multiparty Computation from Somewhat Homomorphic Encryption , 2012, IACR Cryptol. ePrint Arch..
[39] Michael Zohner,et al. ABY - A Framework for Efficient Mixed-Protocol Secure Two-Party Computation , 2015, NDSS.
[40] Patrick Traynor,et al. Frigate: A Validated, Extensible, and Efficient Compiler and Interpreter for Secure Computation , 2016, 2016 IEEE European Symposium on Security and Privacy (EuroS&P).
[41] Michael O. Rabin,et al. How To Exchange Secrets with Oblivious Transfer , 2005, IACR Cryptol. ePrint Arch..
[42] Rafail Ostrovsky,et al. Garbled RAM Revisited , 2014, EUROCRYPT.
[43] David Chaum,et al. Multiparty unconditionally secure protocols , 1988, STOC '88.
[44] David Chaum,et al. Multiparty Unconditionally Secure Protocols (Abstract) , 1987, CRYPTO.
[45] Mihir Bellare,et al. Foundations of garbled circuits , 2012, CCS.
[46] Octavian Catrina,et al. Secure Computation with Fixed-Point Numbers , 2010, Financial Cryptography.
[47] Avi Wigderson,et al. Completeness theorems for non-cryptographic fault-tolerant distributed computation , 1988, STOC '88.
[48] Oded Goldreich,et al. A randomized protocol for signing contracts , 1985, CACM.
[49] Jacques Stern,et al. CryptoComputing with Rationals , 2002, Financial Cryptography.
[50] Yuval Ishai,et al. Secure Arithmetic Computation with No Honest Majority , 2008, IACR Cryptol. ePrint Arch..
[51] Mihir Bellare,et al. Adaptively Secure Garbling with Applications to One-Time Programs and Secure Outsourcing , 2012, ASIACRYPT.
[52] Lior Malka,et al. VMCrypt: modular software architecture for scalable secure computation , 2011, CCS '11.
[53] Andrew Chi-Chih Yao,et al. Protocols for secure computations , 1982, FOCS 1982.
[54] Yuval Ishai,et al. Extending Oblivious Transfers Efficiently , 2003, CRYPTO.
[55] Jonathan Katz,et al. Faster Secure Two-Party Computation Using Garbled Circuits , 2011, USENIX Security Symposium.
[56] Benny Applebaum,et al. Garbling XOR Gates “For Free” in the Standard Model , 2016, Journal of Cryptology.
[57] Jan Willemson,et al. Hybrid Model of Fixed and Floating Point Numbers in Secure Multiparty Computations , 2014, ISC.
[58] Craig Gentry,et al. Fully homomorphic encryption using ideal lattices , 2009, STOC '09.
[59] Silvio Micali,et al. How to play ANY mental game , 1987, STOC.
[60] Donald Beaver,et al. Commodity-based cryptography (extended abstract) , 1997, STOC '97.
[61] Andrew Chi-Chih Yao,et al. How to Generate and Exchange Secrets (Extended Abstract) , 1986, FOCS.