Secure Computation, I/O-Efficient Algorithms and Distributed Signatures. - Ivan Damgård; Jonas Kölker; Tomas Toft (CT-RSA, 2012)

Secret Sharing and Secure Computing from Monotone Formulae. - Ivan Bjerre Damgård; Jonas Kölker; Peter Bro Miltersen (IACR Cryptol. ePrint Arch., 2012)

Kurodoko is NP-Complete. - Jonas Kölker (J. Inf. Process., 2012)

The Magnets Puzzle is NP-Complete. - Jonas Kölker (J. Inf. Process., 2012)

Selected Slither Link Variants are NP-complete. - Jonas Kölker (J. Inf. Process., 2012)

Efficient Multiparty Protocols via Log-Depth Threshold Formulae - (Extended Abstract). - Gil Cohen; Ivan Bjerre Damgård; Yuval Ishai; Jonas Kölker; Peter Bro Miltersen; Ran Raz; Ron D. Rothblum (CRYPTO (2), 2013)

Efficient Multiparty Protocols via Log-Depth Threshold Formulae. - Gil Cohen; Ivan Bjerre Damgård; Yuval Ishai; Jonas Kölker; Peter Bro Miltersen; Ran Raz; Ron Rothblum (Electron. Colloquium Comput. Complex., 2013)