AU About Aarhus University CFEM Research Centers CFEM Publications

Publications

Sort by: Date | Author | Title

Branzei, S. & Procaccia, A. D. (2015). Verifiably Truthful Mechanisms. In T. Roughgarden (Ed.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15 (pp. 297-306 ). Association for Computing Machinery. https://doi.org/10.1145/2688073.2688098

Stidsen, T., Andersen, K. A. & Dammann, B. (2014). A Branch and Bound Algorithm for a Class of Biobjective Mixed Integer Programs. Management Science, 60(4), 1009-1032. https://doi.org/10.1287/mnsc.2013.1802

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

Jakobsen, T. P., Nielsen, J. B. & Orlandi, C. (2014). Framework for Outsourcing of Secure Computation. In G-J. Ahn , A. Oprea & R. Safavi-Naini (Eds.), Proceedings of the 6th edition of the ACM Workshop on Cloud Computing Security, CCSW '14 (pp. 81-92 ). Association for Computing Machinery. https://doi.org/10.1145/2664168.2664170

Damgård, I. B., Pedersen, T. B. & Salvail, L. (2014). How to re-use a one-time pad safely and almost optimally even if P = NP. Natural Computing, 13(4), 469-486. https://doi.org/10.1007/s11047-014-9454-5

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

Branzei, S. & Miltersen, P. B. (2014). Indirect Revelation Mechanisms for Cake Cutting. Abstract from Economics and Computational Aspects of Game Theory and Social Choice, Warsaw, Poland.

Nielsen, J. B., Venturi, D. & Zottarel, A. (2014). Leakage-resilient signatures with graceful degradation. In H. Krawczyk (Ed.), Public-Key Cryptography – PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings (pp. 362-379). Springer. Lecture Notes in Computer Science, Vol.. 8383 https://doi.org/10.1007/978-3-642-54631-0_21

Chattopadhyay, A., Gavaldà, R., Hansen, K. A. & Thérien, D. (2014). Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory of Computing Systems, 55(2), 404-420. https://doi.org/10.1007/s00224-013-9488-6

Miltersen, P. B. (2014). Leibniz International Proceedings in Informatics: Invited talk. Leibniz International Proceedings in Informatics, 25, 11-12. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Cramer, R., Damgård, I. B. & Keller, M. (2014). On the Amortized Complexity of Zero-Knowledge Protocols. Journal of Cryptology, 27(2), 284-316. https://doi.org/10.1007/s00145-013-9145-x

Frederiksen, T. K., Nielsen, J. B. & Orlandi, C. (2014). Privacy-Free Garbled Circuits with Applications To Efficient Zero-Knowledge. (pp. 30). Cryptology ePrint Archive.

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

Nielsen, L. R., Andersen, K. A. & Pretolani, D. D. (2014). Ranking paths in stochastic time-dependent networks. European Journal of Operational Research, 236(3), 903-914. https://doi.org/10.1016/j.ejor.2013.10.022

Damgård, I. B., Fehr, S., Salvail, L. & Schaffner, C. (2014). Secure identification and QKD in the bounded-quantum-storage model. Theoretical Computer Science, 560(1), 12-26. https://doi.org/10.1016/j.tcs.2014.09.014

Miltersen, P. B. (2014). Semi-algebraic geometry in computational game theory - A consumer's perspective: Invited Talk. In E. W. Mayr & N. Portier (Eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (pp. 11-12). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. Leibniz International Proceedings in Informatics, Vol.. 25 https://doi.org/10.4230/LIPIcs.STACS.2014.11

Cascudo Pueyo, I., Damgård, I. B. & Ranellucci, S. (2014). Server-Aided Two-Party Computation with Simultaneous Corruption. (pp. 18). Cryptology ePrint Archive. Report / Cryptology ePrint Archive, No. 2014/809

Balkanski, E., Branzei, S., Kurokawa, D. & Procaccia, A. D. (2014). Simultaneous Cake Cutting. In Proceedings of the 28th AAAI Conference on Artificial Intelligence AAAI Press.

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

Ackerman, M. & Branzei, S. (2014). The Authorship Dilemma: Alphabetical or Contribution? In A. Bazzan & M. Huhns (Eds.), Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems : AAMAS '14 (pp. 1487-1488). Association for Computing Machinery.

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

Hansen, K. A., Ibsen-Jensen, R. & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems, 55(2), 380-403. https://doi.org/10.1007/s00224-013-9524-6

Kennes, J., Monte, D. & Tumennasan, N. (2014). The Daycare Assignment: A Dynamic Matching Problem. American Economic Journal: Microeconomics, 6(4), 362-406.

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.

Kennes, J., Monte, D. & Tumennasan, N. (2014). The day care assignment: A dynamic matching problem. American Economic Journal: Microeconomics, 6(4), 362-406. https://doi.org/10.1257/mic.6.4.362

Filos-Ratsikas, A. & Miltersen, P. B. (2014). Truthful Approximations to Range Voting. In T-Y. Liu, Q. Qi & Y. Ye (Eds.), Web and Internet Economics : 10th Workshop of Internet and Web Economics (WINE), proceedings (pp. 175-188 ). Springer VS. Lecture Notes in Computer Science, Vol.. 8877 https://doi.org/10.1007/978-3-319-13129-0_13

Dahl, M. & Damgård, I. B. (2014). Universally composable symbolic analysis for two-party protocols based on homomorphic encryption. In P. Q. Nguyen & E. Oswald (Eds.), Advances in Cryptology – EUROCRYPT 2014: 33rd Annual International Conference on the Theory and Applications of Cryptographic Techniques, Copenhagen, Denmark, May 11-15, 2014. Proceedings (pp. 695-712). Springer VS. Lecture Notes in Computer Science, Vol.. 8441 https://doi.org/10.1007/978-3-642-55220-5_38

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

Julien, B., Kennes, J. & Ritter, M. (2013). Bidding for Clubs. Aarhus: Institut for Økonomi, Aarhus Universitet. Economics Working Papers, No. 2013-19

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

Kennes, J. & Knowles, J. (2013). Can technological change account for the sexual revolution? Aarhus: Institut for Økonomi, Aarhus Universitet. Economics Working Papers, No. 2013-07

Damgård, I. B. & Zakarias, S. (2013). Constant-overhead secure computation of Boolean circuits using preprocessing. In A. Sahai (Ed.), Theory of Cryptography: 10th TCC 2013. Proceedings (pp. 621-641). Springer VS. Lecture Notes in Computer Science, Vol.. 7785 https://doi.org/10.1007/978-3-642-36594-2_35

Kennes, J. & Knowles, J. (2013). Do Marital Prospects Dissuade Unmarried Fertility? Aarhus: Institut for Økonomi, Aarhus Universitet. Economics Working Papers, No. 2013-06

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).

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

Branzei, S., Caragiannis, I., Kurokawa, D. & Procaccia, A. (2013). Equilibria of Generalized Cut and Choose Protocols. (1307.2225v1 ed.) arXiv.org.

Branzei, S. & Miltersen, P. B. (2013). Equilibrium Analysis in Cake Cutting. In M. Gini & O. Shehory (Eds.), Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems , AAMAS '13 (pp. 327-334 ). Association for Computing Machinery.

Branzei, S., Procaccia, A. & Zhang, J. (2013). Externalities in Cake Cutting. Proceedings of the International Joint Conference on Artificial Intelligence, 13.

Frederiksen, T. K. & Nielsen, J. B. (2013). Fast and maliciously secure two-party computation using the GPU. In Applied Cryptography and Network Security: 11th International Conference, ACNS 2013, Banff, AB, Canada, June 25-28, 2013. Proceeding (pp. 339-356). Springer VS. Lecture Notes in Computer Science, Vol.. 7954 https://doi.org/10.1007/978-3-642-38980-1_21

Branzei, S., Caragiannis, I., Morgenstern, J. & Procaccia, A. (2013). How Bad is Selfish Voting? In Proceedings of the Twenty-Seventh AAAI Conference on Artificial Intelligence AAAI Press.

Kennes, J. & le Maire, D. (2013). Job Heterogeneity and Coordination Frictions. Aarhus: Institut for Økonomi, Aarhus Universitet. Economics Working Papers, No. 2013-09

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

Branzei, S., Michalak, T., Rahwan, T., Larson, K. & Jennings, N. (2013). Matchings with Externalities and Attitudes. In M. Gina & O. Shehory (Eds.), International Conference on Autonomous Agents and Multi-agent Systems, AAMAS '13 (pp. 295-302 ). Association for Computing Machinery.

Displaying results 51 to 100 out of 194

Comments on content:
Revised 13.09.2019

Department of Computer Science

Publications

Contact Information