Publications

List of publications

Sort by: Date | Author | Title

Nan Cheng, Gupta, N., Mitrokotsa, A. & Tozawa, K. (2024). Constant-Round Private Decision Tree Evaluation for Secret Shared Data. Proceedings on Privacy Enhancing Technologies, 2024(1), 397-412. https://doi.org/10.56553/popets-2024-0023

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, R. W. & Damgård, I. B. (2015). Fast Oblivious AES A Dedicated application of the MiniMac protocol. https://eprint.iacr.org/2015/989.pdf

Yakoubov, S., Pagnin, E. & Kolby, S. (2024). Multi Designated Verifier Ring Signatures. IACR Communications in Cryptology, 1(3). https://doi.org/10.62056/a33zivrzn

Woodcock, J., Andersen, M. S., Aranha, D. F., Hallerstede, S., Hansen, S. T., Jakobsen, N. K., Kulik, T., Larsen, P. G., Macedo, H. D., Martin, C. I. I. & Norrild, V. A. M. (2023). State of the Art Report: Verified Computation. https://doi.org/10.48550/arXiv.2308.15191

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

V. L. Pereira, H. & Aranha, D. F. (2016). Principal Component Analysis over encrypted data using Homomorphic Encryption. Abstract from Workshop on Homomorphic Encryption Applications and Technology, Paris, France. https://www.researchgate.net/publication/312028896_Principal_Component_Analysis_over_encrypted_data_using_Homomorphic_Encryption

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

Vanegas, H., Cabarcas, D. & Aranha, D. F. (2023). Privacy-Preserving Edit Distance Computation Using Secret-Sharing Two-Party Computation. In A. Aly & M. Tibouchi (Eds.), Progress in Cryptology – LATINCRYPT 2023: 8th International Conference on Cryptology and Information Security in Latin America, LATINCRYPT 2023, Quito, Ecuador, October 3–6, 2023, Proceedings (pp. 67-86). Springer. https://doi.org/10.1007/978-3-031-44469-2_4

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

Tozawa, K., Morita, H. & Mizuki, T. (2023). Single-Shuffle Card-Based Protocol with Eight Cards per Gate. In D. Genova & J. Kari (Eds.), Unconventional Computation and Natural Computation: 20th International Conference, UCNC 2023, Jacksonville, FL, USA, March 13–17, 2023, Proceedings (pp. 171-185). Springer. https://doi.org/10.1007/978-3-031-34034-5_12

Tozawa, K., Morita, H. & Mizuki, T. (2025). Single-shuffle card-based protocol with eight cards per gate and its extensions. Natural Computing, 24(1), 131-147. https://doi.org/10.1007/s11047-024-10006-5

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

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

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

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 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2022.8

Roy, L. & Xu, J. (2023). A Universally Composable PAKE with Zero Communication Cost: (And Why It Shouldn’t Be Considered UC-Secure). In A. Boldyreva & V. Kolesnikov (Eds.), Public-Key Cryptography – PKC 2023: 26th IACR International Conference on Practice and Theory of Public-Key Cryptography, Atlanta, GA, USA, May 7–10, 2023, Proceedings, Part I (pp. 714-743). Springer. https://doi.org/10.1007/978-3-031-31368-4_25

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

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

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, 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

Pedersen, J. M., Blatchley Hansen, A. & Halbe Torres, M. (2023). Winning the European Cyber Security Challenge 2022: What did We Learn? In International Symposium on Project Approaches in Engineering Education (pp. 139-148) http://paee.dps.uminho.pt/proceedingsSCOPUS/PAEE_ALE_2023_PROCEEDINGS.pdf

Pagter, J. I., Toft, T., Damgård, I. B., Bogetoft, P., Nielsen, K. & Jakobsen, T. (2005). Secure Computing, Economy, and Trust - A Generic Solution for Secure Auctions with Real-World Applications. BRICS Report Series, (RS-05-18), 1-35.

Pagnin, E., Gunnarsson, G., Talebi, P., Orlandi, C. & Sabelfeld, A. (2019). TOPPool: Time-aware Optimized Privacy-Preserving Ridesharing. Proceedings on Privacy Enhancing Technologies, 2019(4), 93-111. https://doi.org/10.2478/popets-2019-0060

Orlandi, C. (2011). Is Multiparty Computation Any Good In Practice? I E E E International Conference on Acoustics, Speech and Signal Processing. Proceedings, 5848-5851. https://doi.org/10.1109/ICASSP.2011.5947691

Orlandi, C., Ostrovsky, R., Rao, V., Sahai, A. & Visconti, I. (2014). Statistical Concurrent Non-malleable Zero Knowledge. In Y. Lindell (Ed.), Theory of Cryptography: 11th Theory of Cryptography Conference, TCC 2014, 2014. Proceedings (pp. 167-191). Springer Publishing Company. https://doi.org/10.1007/978-3-642-54242-8_8

Orlandi, C. (2017). Faster Zero-Knowledge Protocols and Applications: Invited Talk Abstract. In P. Farshim & E. Simion (Eds.), Innovative Security Solutions for Information Technology and Communications - 10th International Conference,SecITC 2017, Revised Selected Papers: Innovative Security Solutions for Information Technology and Communications (Vol. 10543, pp. 1-11). Springer VS. https://doi.org/10.1007/978-3-319-69284-5_1

Orlandi, C., Scholl, P. & Yakoubov, S. (2021). The Rise of Paillier: Homomorphic Secret Sharing and Public-Key Silent OT. In A. Canteaut & F.-X. Standaert (Eds.), Advances in Cryptology – EUROCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 678-708). Springer. https://doi.org/10.1007/978-3-030-77870-5_24

Orlandi, C., Ravi, D. & Scholl, P. (2022). On the Bottleneck Complexity of MPC with Correlated Randomness. In G. Hanaoka, J. Shikata & Y. Watanabe (Eds.), Public-Key Cryptography – PKC 2022: 25th IACR International Conference on Practice and Theory of Public-Key Cryptography, Virtual Event, March 8–11, 2022, Proceedings, Part I (pp. 194-220). Springer. https://doi.org/10.1007/978-3-030-97121-2_8

Orlandi, C. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

Oliveira, L. B., Quintao Pereira, F. M., Misoczki, R., Aranha, D. F., Borges, F. & Liu, J. (2017). The Computer for the 21st Century: Security & Privacy Challenges After 25 Years. In 2017 26th International Conference on Computer Communications and Networks, ICCCN 2017 Article 8038394 IEEE. https://doi.org/10.1109/ICCCN.2017.8038394

Oliveira, T., Lopez, J. & Aranha, D. F. (2014). Two is the fastest prime: lambda coordinates for binary elliptic curves. Journal of Cryptographic Engineering, 4(1), 3-17. https://doi.org/10.1007/s13389-013-0069-z

Oliveira, L. B., Kansal, A., Gouvea, C. P. L., Aranha, D. F., Lopez, J., Priyantha, B., Goraczko, M. & Zhao, F. (2011). Secure-TWS: Authenticating Node to Multi-user Communication in Shared Sensor Networks. The Computer Journal, 55(4), 384-396. https://doi.org/10.1093/comjnl/bxr089

Oliveira, L. B., Aranha, D. F., Gouvea, C. P. L., Scott, M., Camara, D. F., Lopez, J. & Dahab, R. (2010). TinyPBC: Pairings for authenticated identity-based non-interactive key distribution in sensor networks. Computer Communications, 34(3), 485-493. https://doi.org/10.1016/j.comcom.2010.05.013

Oliveira, T., Aranha, D. F., Lopez, J. & Rodriguez-henriquez, F. (2014). Fast Point Multiplication Algorithms for Binary Elliptic Curves with and without Precomputation. In A. Joux & A. Youssef (Eds.), Selected Areas in Cryptography -- SAC 2014 (pp. 324-344). Springer. https://doi.org/10.1007/978-3-319-13051-4_20

Oliveira, T., Lopez, J., Aranha, D. F. & Rodriguez-henriquez, F. (2013). Lambda Coordinates for Binary Elliptic Curves. In G. Bertoni & J.-S. Coron (Eds.), Cryptographic Hardware and Embedded Systems - CHES 2013 (pp. 311-330). Springer. https://doi.org/10.1007/978-3-642-40349-1_18

Oliveira, L. B., Aranha, D. F., Morais, E., Daguano, F., Lopez, J. & Dahab, R. (2007). TinyTate: Computing the Tate Pairing in Resource-Constrained Sensor Nodes. In Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)(NCA) (pp. 318-323). IEEE. https://doi.org/10.1109/NCA.2007.48

Oliveira, L. B., Pereira, F. M. Q., Misoczki, R., Aranha, D. F., Borges, F., Nogueira, M., Wangham, M., Wu, M. & Liu, J. (2018). The computer for the 21st century: present security & privacy challenges. Journal of Internet Services and Applications, 9(24), Article 24. https://doi.org/10.1186/s13174-018-0095-2

Obremski, M., Ribeiro, J., Roy, L., Standaert, F.-X. & Venturi, D. (2024). Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences. In L. Reyzin & D. Stebila (Eds.), Advances in Cryptology -- CRYPTO 2024 (pp. 461-491). Springer Nature. https://doi.org/10.1007/978-3-031-68391-6_14

Nissim, K., Orlandi, C. & Smorodinsky, R. (2012). Privacy-aware mechanism design. In B. Faltings (Ed.), Proceedings of the ACM Conference on Electronic Commerce, EC '12 (pp. 774-789). Association for Computing Machinery. https://doi.org/10.1145/2229012.2229073

Displaying results 1 to 50 out of 593

Revised 04.11.2025

Marianne Dammand Iversen