Author of the publication

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract).

, , , , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 185-202. Springer, (2013)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Selected Slither Link Variants are NP-complete.. J. Inf. Process., 20 (3): 709-712 (2012)Secret Sharing and Secure Computing from Monotone Formulae., , and . IACR Cryptology ePrint Archive, (2012)Secure Computation, I/O-Efficient Algorithms and Distributed Signatures., , and . CT-RSA, volume 7178 of Lecture Notes in Computer Science, page 278-295. Springer, (2012)The Magnets Puzzle is NP-Complete.. J. Inf. Process., 20 (3): 707-708 (2012)Kurodoko is NP-Complete.. J. Inf. Process., 20 (3): 694-706 (2012)Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract)., , , , , , and . CRYPTO (2), volume 8043 of Lecture Notes in Computer Science, page 185-202. Springer, (2013)Efficient Multiparty Protocols via Log-Depth Threshold Formulae., , , , , , and . Electron. Colloquium Comput. Complex., (2013)