Topology-Hiding Computation Beyond Logarithmic Diameter
暂无分享,去创建一个
[1] Anat Paskin-Cherniavsky,et al. Non-Interactive Secure Multiparty Computation , 2014, IACR Cryptol. ePrint Arch..
[2] Ueli Maurer,et al. Network-Hiding Communication and Applications to Multi-Party Protocols , 2016, IACR Cryptol. ePrint Arch..
[3] Ran Canetti,et al. Universally composable security: a new paradigm for cryptographic protocols , 2001, Proceedings 2001 IEEE International Conference on Cluster Computing.
[4] Amit Sahai,et al. Multi-Input Functional Encryption , 2014, IACR Cryptol. ePrint Arch..
[5] Yuval Ishai,et al. Secure Multiparty Computation with General Interaction Patterns , 2016, IACR Cryptol. ePrint Arch..
[6] E. Kushilevitz. Foundations of Cryptography Foundations of Cryptography , 2014 .
[7] Thomas Sauerwald,et al. Diameter and Broadcast Time of Random Geometric Graphs in Arbitrary Dimensions , 2011, Algorithmica.
[8] Rafail Ostrovsky,et al. The Hidden Graph Model: Communication Locality and Optimal Resiliency with Adaptive Faults , 2015, ITCS.
[9] Silas Richelson,et al. Topology-Hiding Computation , 2015, TCC.
[10] Yehuda Lindell,et al. Secure Computation on the Web: Computing without Simultaneous Interaction , 2011, IACR Cryptol. ePrint Arch..
[11] Gregory J. Pottie,et al. Wireless integrated network sensors , 2000, Commun. ACM.
[12] Andreas Jakoby,et al. Communications in unknown networks: Preserving the secret of topology , 2007, Theor. Comput. Sci..
[13] Satish Kumar,et al. Next century challenges: scalable coordination in sensor networks , 1999, MobiCom.
[14] Mathew D. Penrose,et al. Random Geometric Graphs , 2003 .