Publications

List of publications

Sort by: Date | Author | Title

Zhao, Y., Nielsen, J. B., Deng, R. H. & Feng, D. (2005). Generic yet Practical ZK Arguments from any Public-Coin HVZK. Electronic Colloquium on Computational Complexity, (TR05-162), 1-16.

Zakarias, S. N. H. (2014). Secure Computation in the Preprocessing Model. Department of Computer Science, Aarhus University.

Zakarias, R. W. & Damgård, I. B. (2015). Fast Oblivious AES A Dedicated application of the MiniMac protocol. https://eprint.iacr.org/2015/989.pdf

V. L. Pereira, H. & Aranha, D. F. (2017). Non-interactive Privacy-preserving k-NN Classifier. In P. Mori, S. Furnell & O. Camp (Eds.), ICISSP 2017 - Proceedings of the 3rd International Conference on Information Systems Security and Privacy (Vol. 1, pp. 362-371) https://doi.org/10.5220/0006187703620371

Velasquez, K., Perez Abreu, D., Assis, M. R. M., Senna, C., Aranha, D. F., Bittencourt, L. F., Laranjeiro, N., Curado, M., Vieira, M., Monteiro, E. & Madeira, E. (2018). Fog orchestration for the Internet of Everything: state-of-the-art and research challenges. Journal of Internet Services and Applications, 9(14), Article 14. https://doi.org/10.1186/s13174-018-0086-3

Ubys, L., Vancea, V. N., Kulik, T., Larsen, P. G., Boudjadar, J. & Aranha, D. F. (2022). Formal Model In-The-Loop for Secure Industrial Control Networks. In Formal Aspects of Component Software - 18th International Conference, FACS 2022, Proceedings (pp. 74-89). Springer. https://doi.org/10.1007/978-3-031-20872-0_5

Troi, A., Jørgensen, B. N., Larsen, E. M., Blaabjerg, F., Mikkelsen, G. L., Slente, H. P., Madsen, H., Østergaard, J., Entwistle, J. M., Nordentoft, N. C., Meibom, P., Jacobsen, R. H., Thorvildsen, S. & Jørgensen, U. (2013). The smart grid research network: Road map for smart grid research, development and demonstration up to 2020. http://orbit.dtu.dk/fedora/objects/orbit:120708/datastreams/file_593c582c-5f51-4d45-adb4-290c796ad776/content

Trifiletti, R., Nielsen, J. B., Frederiksen, T. K. & Jakobsen, T. P. (2016). On the Complexity of Additively Homomorphic UC Commitments. In E. Kushilevitz & T. Malkin (Eds.), Theory of Cryptography - 13th International Conference, TCC 2016-A, Proceedings (Vol. 9562, pp. 542-565). Springer VS. https://doi.org/10.1007/978-3-662-49096-9

Toft, T. (2007). Primitives and Applications for Multi-party Computation. Department of Computer Science, Aarhus University. Daimi PhD Dissertation No. PD-07-7

Toft, T. (2009). Solving Linear Programs Using Multiparty Computation. Lecture Notes in Computer Science, 5628, 90-107. https://doi.org/10.1007/978-3-642-03549-4_6

Toft, T. (2009). Constant-Rounds, Almost-Linear Bit-Decomposition of Secret Shared Values. Lecture Notes in Computer Science, 357-371. https://doi.org/10.1007/978-3-642-00862-7_24

Toft, T. (2006). An efficient, unconditionally secure equality test for secret shared values. In Proceedings of the 2006 Workshop on Models for Cryptographic Protocols

Toft, T. (2011). Sub-linear, Secure Comparison With Two Non-Colluding Parties. Lecture Notes in Computer Science, 6571, 174-191. https://doi.org/10.1007/978-3-642-19379-8_11

Toft, T. (2011). Secure data structures based on multi-party computation. In Proceedings of the 30th Annual ACM SIGACT-SIGOPS ACM Symposium on Principles of Distributed Computing, PODC 2011 (pp. 291-292). Association for Computing Machinery. https://doi.org/10.1145/1993806.1993859

Toft, T. (2013). A Secure Priority Queue; or: On Secure Datastructures from Multiparty Computation.. Paper presented at International Conference on Information Security and Cryptology, Seoul, Korea, Republic of. http://www.wikicfp.com/cfp/program?id=1397&s=ICISC&f=International%20Conference%20on%20Information%20Security%20and%20Cryptology

Toft, T. (2014). A secure priority queue; or: On secure datastructures from multiparty computation. In H-S. Lee & D-G. Han (Eds.), Information Security and Cryptology -- ICISC 2013: 16th International Conference, Seoul, Korea, November 27-29, 2013, Revised Selected Papers (Vol. 8565, pp. 20-33). Springer. https://doi.org/10.1007/978-3-319-12160-4_2

Thomsen, S. E. & Spitters, B. (2021). Formalizing Nakamoto-Style Proof of Stake. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 IEEE. https://doi.org/10.1109/CSF51468.2021.00042

Thomsen, S. E. (2023). Message Dissemination in the Nakamoto Era. Aarhus Universitet.

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Speeding scalar multiplication over binary elliptic curves using the new carry-less multiplication instruction. Journal of Cryptographic Engineering, 1, 187-199. https://doi.org/10.1007/s13389-011-0017-8

Taverne, J., Faz-Hernandez, A., Aranha, D. F., Rodriguez-henriquez, F., Hankerson, D. & Lopez, J. (2011). Software Implementation of Binary Elliptic Curves: Impact of the Carry-Less Multiplier on Scalar Multiplication. In B. Preneel & T. Takagi (Eds.), Cryptographic Hardware and Embedded Systems – CHES 2011 (pp. 108-123). Springer. https://doi.org/10.1007/978-3-642-23951-9_8

Takahashi, A., Tibouchi, M. & Abe, M. (2018). New Bleichenbacher Records: Fault Attacks on qDSA Signatures. IACR Transactions of Cryptographic Hardware and Embedded Systems, 2018(3), 331-371. https://doi.org/10.13154/tches.v2018.i3.331-371

Takahashi, A. & Tibouchi, M. (2019). Degenerate Fault Attacks on Elliptic Curve Parameters in OpenSSL. In 2019 IEEE European Symposium on Security and Privacy (EuroS&P), Proceedings (pp. 371-386). Article 8806763 IEEE. https://doi.org/10.1109/EuroSP.2019.00035

Takahashi, A. (2022). Cryptography from Zero Knowledge - Advanced Security and New Constructions. Aarhus Universitet.

Surita, R. C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2018). CRPUF: A modeling-resistant delay PUF based on cylindrical reconvergence. Microprocessors and Microsystems, 60, 185-195. https://doi.org/10.1016/j.micpro.2018.05.006

Surita, R. C., Cortes, M. L., Aranha, D. F. & Araujo, G. (2016). Cylindrical Reconvergence Physical Unclonable Function. In Proceedings - 19th Euromicro Conference on Digital System Design, DSD 2016 (pp. 446-453). Article 7723585 https://doi.org/10.1109/DSD.2016.100

Sousa Jr., E. F., Alchieri, E., Aranha, D. F. & Solis, P. (2019). Building Secure Protocols for Extensible Distributed Coordination through Secure Extensions. Computers & Security, 87(November), Article 101583. https://doi.org/10.1016/j.cose.2019.101583

Simkin, M. (2020). Alice, Bits, and Bob.

Simkin, M., Siniscalchi, L. & Yakoubov, S. (2022). On Sufficient Oracles for Secure Computation with Identifiable Abort. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks - 13th International Conference, SCN 2022, Proceedings (pp. 494-515). Springer. https://doi.org/10.1007/978-3-031-14791-3_22

Sidorenco, N., Oechsner, S. & Spitters, B. (2021). Formal security analysis of MPC-in-the-head zero-knowledge protocols. In Proceedings - 2021 IEEE 34th Computer Security Foundations Symposium, CSF 2021 (pp. 607-620). IEEE. https://doi.org/10.1109/CSF51468.2021.00050

Segal, S., Adi, Y., Pinkas, B., Baum, C., Ganesh, C. & Keshet, J. (2021). Fairness in the Eyes of the Data: Certifying Machine-Learning Models. In AIES 2021 - Proceedings of the 2021 AAAI/ACM Conference on AI, Ethics, and Society (pp. 926-935). Association for Computing Machinery. https://doi.org/10.1145/3461702.3462554

Schwartzbach, N. I. (2021). An Incentive-Compatible Smart Contract for Decentralized Commerce. In IEEE International Conference on Blockchain and Cryptocurrency, ICBC 2021 (pp. 1-3). IEEE. https://doi.org/10.1109/ICBC51069.2021.9461077

Schwartzbach, N. I. (2022). Payment Schemes from Limited Information with Applications in Distributed Computing. In EC '22: Proceedings of the 23rd ACM Conference on Economics and Computation (pp. 129-149) https://doi.org/10.1145/3490486.3538342

Scholl, P., Smart, N. P. & Wood, T. (2017). When It’s All Just Too Much: Outsourcing MPC-Preprocessing. In M. O'Neill (Ed.), Cryptography and Coding - 16th IMA International Conference, IMACC 2017, Proceedings (Vol. 10655, pp. 77-99). Springer VS. https://doi.org/10.1007/978-3-319-71045-7_4

Scholl, P. (2018). Extending Oblivious Transfer with Low Communication via Key-Homomorphic PRFs. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 (Vol. 10769, pp. 554-583). Springer VS. https://doi.org/10.1007/978-3-319-76578-5_19

Scholl, P., Simkin, M. & Siniscalchi, L. (2022). Multiparty Computation with Covert Security and Public Verifiability. In D. Dachman-Soled (Ed.), 3rd Conference on Information-Theoretic Cryptography, ITC 2022 Article 8 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

Scafuro, A., Siniscalchi, L. & Visconti, I. (2019). Publicly Verifiable Proofs from Blockchains. In D. Lin & K. Sako (Eds.), Public-Key Cryptography – PKC 2019 (pp. 374-401). Springer. https://doi.org/10.1007/978-3-030-17253-4_13

Scafuro, A., Siniscalchi, L. & Visconti, I. (2021). Publicly Verifiable Zero Knowledge from (Collapsing) Blockchains. In J. A. Garay (Ed.), Public-Key Cryptography – PKC 2021: 24th IACR International Conference on Practice and Theory of Public Key Cryptography, Virtual Event, May 10–13, 2021, Proceedings, Part II (pp. 469-498). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-030-75248-4_17

Rodriguez, B., Pereira, F. M. Q. & Aranha, D. F. (2016). Sparse representation of implicit flows with applications to side-channel detection. In Proceedings of CC 2016: The 25th International Conference on Compiler Construction (pp. 110-120). ACM. https://doi.org/10.1145/2892208.2892230

Rocha, R. V. M., Libório, P. P., Kupwade Patil, H. & Aranha, D. F. (2021). A Differentially Private Hybrid Approach to Traffic Monitoring. In K. Sako & N. O. Tippenhauer (Eds.), Applied Cryptography and Network Security - ACNS 2021 (pp. 233-256). Springer. https://doi.org/10.1007/978-3-030-78375-4_10

Riedel, C., Michael, G. G., Orgel, C., Baum, C., van der Bogert, C. H. & Hiesinger, H. (2021). Studying the Global Spatial Randomness of Impact Craters on Mercury, Venus, and the Moon With Geodesic Neighborhood Relationships. Journal of Geophysical Research: Planets, 126(3), Article e2020JE006693. https://doi.org/10.1029/2020JE006693

Reyzin, L., Smith, A. & Yakoubov, S. (2021). Turning HATE Into LOVE: Compact Homomorphic Ad Hoc Threshold Encryption for Scalable MPC. In Cyber Security Cryptography and Machine Learning - 5th International Symposium, CSCML 2021, Proceedings: Proceedings (Vol. 12716, pp. 361-378). Springer. https://doi.org/10.1007/978-3-030-78086-9_27

Reistad, T. & Toft, T. (2010). Linear, Constant-rounds Bit-decomposition. Lecture Notes in Computer Science, 5984, 245-257. https://doi.org/10.1007/978-3-642-14423-3_17

Reistad, T. & Toft, T. (2009). Secret Sharing Comparison by Transformation and Rotation. Lecture Notes in Computer Science, 169-180. https://doi.org/10.1007/978-3-642-10230-1_14

Raskin, M. & Simkin, M. (2019). Perfectly Secure Oblivious RAM with Sublinear Bandwidth Overhead. In S. D. Galbraith & S. Moriai (Eds.), Advances in Cryptology – ASIACRYPT 2019 - 25th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings: 25th International Conference on the Theory and Application of Cryptology and Information Security Kobe, Japan, December 8–12, 2019 Proceedings (Vol. II, pp. 537-563). Springer. https://doi.org/10.1007/978-3-030-34621-8_19

Rachuri, S. R., Suresh, A. & Chaudhari, H. (2020). Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning. In Proceedings 2020 Network and Distributed System Security Symposium (pp. 1-18). Internet Society. https://doi.org/10.14722/ndss.2020.23005

Rachuri, R. & Scholl, P. (2022). Le Mans: Dynamic and Fluid MPC for Dishonest Majority. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 719-749). Springer. https://doi.org/10.1007/978-3-031-15802-5_25

Polychroniadou, A., Damgård, I. B., Garg, S., Mukherjee, P., Nielsen, J. B. & Pandey, O. (2016). On the Communication and Round Complexity of Secure Computation. Institut for Datalogi, Aarhus Universitet. http://cs.au.dk/fileadmin/user_upload/IvanFest_AP.pdf

Pinkas, B., Baum, C., Adi, Y., Keshet, Y. & Cisse, M. (2018). Turning your weakness into a strength: Watermarking deep neural networks by backdooring. In Proceedings of the 27th USENIX Security Symposium (pp. 1615-1631) https://arxiv.org/abs/1802.04633

Pedersen, M. Ø. & Pagter, J. I. (2007). The All-or-Nothing Anti-Theft Policy - Theft Protection for Pervasive Computing. In Proceedings of AINA Workshops (1 ed., Vol. 1, pp. 626-631). IEEE Computer Society Press.

Patra, A. & Ravi, D. (2023). Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. Journal of Cryptology, 36(3), Article 30. https://doi.org/10.1007/s00145-023-09468-0

Displaying results 1 to 50 out of 624

Revised 04.10.2023

Marianne Dammand Iversen