Damgård, I. B. & Nielsen, J. B. (2014).
Adaptive versus static security in the UC Model. In S. S. M. Chow , J. K. Liu, L. C. K. Hui & S. M. Yiu (Eds.),
Provable Security: 8th International Conference, ProvSec 2014, Hong Kong, China, October 9-10, 2014. Proceedings (pp. 10-28). Springer VS. Lecture Notes in Computer Science Vol. 8782
https://doi.org/10.1007/978-3-319-12475-9_2
Damgård, I. B., Lauritsen, R. & Toft, T. (2014).
An Empirical Study and some Improvements of the MiniMac Protocol for Secure Computation. In M. Abdalla & R. D. Prisco (Eds.),
Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 398-415 ). Springer. Lecture Notes in Computer Science Vol. 8642
https://doi.org/10.1007/978-3-319-10879-7_23
Hansen, K. A., Komarath, B., Sarma M. N., J.
, Talebanfard, N. & Skyum, S. (2014).
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. In E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (Eds.),
Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (pp. 336-347 ). Springer VS. Lecture Notes in Computer Science Vol. 8635
https://doi.org/10.1007/978-3-662-44465-8_29
Damgård, I. B., David, B. M., Giacomelli, I. & Nielsen, J. B. (2014).
Compact VSS and Efficient Homomorphic UC Commitments. In P. Sarkar & T. Iwata (Eds.),
Advances in Cryptology – ASIACRYPT 2014: 20th International Conference on the Theory and Application of Cryptology and Information Security, Kaoshiung, Taiwan, R.O.C., December 7-11, 2014, Proceedings, Part II (pp. 213-232 ). Springer VS. Lecture Notes in Computer Science Vol. 8874
https://doi.org/10.1007/978-3-662-45608-8_12
Faust, S., Mukherjee, P., Nielsen, J. B. & Venturi, D. (2014).
Continuous Non-malleable Codes. In Y. Lindell (Ed.),
Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, San Diego, CA, USA, February 24-26, 2014. Proceedings (pp. 465-488). Springer. Lecture Notes in Computer Science Vol. 8349
https://doi.org/10.1007/978-3-642-54242-8_20
Frederiksen, T. K., Jakobsen, T. P. & Nielsen, J. B. (2014).
Faster Maliciously Secure Two-Party Computation Using the GPU. In M. Abdalla & R. D. Prisco (Eds.),
Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 358-379 ). Springer. Lecture Notes in Computer Science Vol. 8642
https://doi.org/10.1007/978-3-319-10879-7_21
Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A.
, Branzei, S., Wooldridge, M. & Jennings , N. (2014).
Implementation and Computation of a Value for Generalized Characteristic Function Games.
A C M Transactions on Economics and Computation,
2(4), [16].
https://doi.org/10.1145/2665007
Baum, C., Damgård, I. B. & Orlandi, C. (2014).
Publicly Auditable Secure Multi-Party Computation. In M. Abdalla & R. D. Prisco (Eds.),
Security and Cryptography for Networks: 9th International Conference, SCN 2014, Amalfi, Italy, September 3-5, 2014. Proceedings (pp. 175-196 ). Springer VS. Lecture Notes in Computer Science Vol. 8642
https://doi.org/10.1007/978-3-319-10879-7_11
Damgård, I. B., Funder, J., Nielsen, J. B. & Salvail, L. (2014).
Superposition attacks on cryptographic protocols. In C. Padró (Ed.),
Information Theoretic Security: 7th International Conference, ICITS 2013, Singapore, November 28-30, 2013, Proceedings (pp. 142-161). Springer. Lecture Notes in Computer Science Vol. 8317
https://doi.org/10.1007/978-3-319-04268-8_9
Etessami, K.
, Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014).
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. In R. Lavi (Ed.),
Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (pp. 231-243 ). Springer VS. Lecture Notes in Computer Science Vol. 8768
https://doi.org/10.1007/978-3-662-44803-8_20
Branzei, S., Chen, Y., Deng, X.
, Filos-Ratsikas, A., Frederiksen, S. K. S. & Zhang, J. (2014).
The Fisher Market Game: Equilibrium and Welfare. In
Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (pp. 587-593). AAAI Press.
http://www.aaai.org/Library/AAAI/aaai14contents.php
Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2013).
A Faster Algorithm for Solving One-Clock Priced Timed Games. In P. R. D*Argenio & H. Melgratti (Eds.),
CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (pp. 531-545). Springer VS. Lecture Notes in Computer Science Vol. 8052
https://doi.org/10.1007/978-3-642-40184-8_37
Frederiksen, S. K. S. & Miltersen, P. B. (2013).
Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. In L. Cai, S-W. Cheng & T-W. Lam (Eds.),
Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 457-467 ). Springer VS. Lecture Notes in Computer Science Vol. 8283
https://doi.org/10.1007/978-3-642-45030-3_43
Damgård, I. B., Faust, S., Mukherjee, P. & Venturi, D. (2013).
Bounded Tamper Resilience: How to Go beyond the Algebraic Barrier. In K. Sako & P. Sarkar (Eds.),
Advances in Cryptology - ASIACRYPT 2013: 19th International Conference on the Theory and Application of Cryptology and Information Security, Bengaluru, India, December 1-5, 2013, Proceedings, Part II (pp. 140-160 ). Springer VS. Lecture Notes in Computer Science Vol. 8270
https://doi.org/10.1007/978-3-642-42045-0_8
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013).
Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed.
Electronic Colloquium on Computational Complexity, (TR13-107).
http://eccc.hpi-web.de/report/2013/107/
Cohen, G.
, Damgård, I. B., Ishai, Y.
, Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013).
Efficient multiparty protocols via log-depth threshold formulae. In R. Canetti & J. A. Garay (Eds.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (pp. 185-202). Springer VS. Lecture Notes in Computer Science Vol. 8043
https://doi.org/10.1007/978-3-642-40084-1_11
Hazay, C., López-Alt, A., Wee, H.
& Wichs, D. (2013).
Leakage-resilient cryptography from minimal assumptions. In T. Johansson & P. Nguyen (Eds.),
Leakage-Resilient Cryptography from Minimal Assumptions: 32nd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Athens, Greece, May 26-30, 2013. Proceedings (pp. 160-176). Springer VS. Lecture Notes in Computer Science Vol. 7881
https://doi.org/10.1007/978-3-642-38348-9_10
Hubacek, P., Nielsen, J. B. & Rosen, A. (2013).
Limits on the Power of Cryptographic Cheap Talk. In R. Canetti & J. A. Garay (Eds.),
Advances in Cryptology – CRYPTO 2013: 33rd Annual Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2013. Proceedings, Part I (pp. 277-297 ). Springer VS. Lecture Notes in Computer Science Vol. 8042
https://doi.org/10.1007/978-3-642-40041-4_16