Search Results

1 - 2 of 2 items :

  • "covert security" x
  • Computer Sciences x
Clear All

constant-rounds multiparty computation for equality, comparison, bits and exponentiation. In TCC (2006), S. Halevi and T. Rabin, Eds., vol. 3876 of LNCS , Springer, pp. 285–304. [19] D amgård , I., G eisler , M., K røigaard , M., and N ielsen , J. B. Asynchronous Multiparty Computation: Theory and Implementation. In Public Key Cryptography (2009), S. Jarecki and G. Tsudik, Eds., vol. 5443 of LNCS , Springer, pp. 160–179. [20] D amgård , I., G eisler , M., and N ielsen , J. B. From passive to covert security at low cost. In TCC (2010), D. Micciancio, Ed., vol

LEGO. In NDSS’17 . The Internet Society, 2017. [42] Y. Aumann and Y. Lindell. Security against covert adversaries: Efficient protocols for realistic adversaries. In TCC’07 , volume 4392 of LNCS , pages 137–156. Springer, 2007. [43] I. Damgård, M. Geisler, and J. B. Nielsen. From passive to covert security at low cost. In TCC’10 , volume 5978 of LNCS , pages 128–145. Springer, 2010. [44] G. Asharov and C. Orlandi. Calling out cheaters: Covert security with public verifiability. In ASIACRYPT’12 , volume 7658 of LNCS , pages 681–698. Springer, 2012. [45] Vladimir