Author:
Blanton Marina,Aguiar Everaldo
Publisher
Springer Science and Business Media LLC
Subject
Computer Networks and Communications,Safety, Risk, Reliability and Quality,Information Systems,Software
Reference72 articles.
1. Ajtai, M., Komlós, J., Szemerédi, E.: An $${O}(n \log n)$$ O ( n log n ) sorting network. In: STOC, pp. 1–9 (1983)
2. Aliasgari, M., Blanton, M., Zhang, Y., Steele, A.: Secure computation on floating point numbers. In: Network and Distributed System Security Symposium (NDSS) (2013)
3. Asharov, G., Lindell, Y.: A full proof of the BGW protocol for perfectly-secure multiparty computation. In: Electronic Colloqium on Computational Complexity (ECCC), Report No. 36 (2011)
4. Asharov, G., Lindell, Y., Rabin, T.: Perfectly-secure multiplication for any $$t< n/3$$ t < n / 3 . In: CRYPTO (2011)
5. Ateniese, G., De Cristofaro, E., Tsudik, G.: (If) size matters: size-hiding private set intersection. In: Public Key Cryptography (PKC), LNCS, vol. 6571, pp. 156–173 (2011)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献