Publications

List of publications

Larsen, K. G. & Simkin, M. (2020). Secret sharing lower bound: Either reconstruction is hard or shares are long. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 566-578). Springer. https://doi.org/10.1007/978-3-030-57990-6_28

Lucani Rötter, D. E., Nielsen, L., Orlandi, C., Pagnin, E. & Vestergaard, R. (2020). Secure generalized deduplication via multi-key revealing encryption. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 298-318). Springer. https://doi.org/10.1007/978-3-030-57990-6_15

Dalskov, A. P. K., Orlandi, C., Keller, M., Shrishak, K. & Shulman, H. (2020). Securing DNSSEC Keys via Threshold ECDSA from Generic MPC. In L. Chen, S. Schneider, N. Li & K. Liang (Eds.), European Symposium on Research in Computer Security : Computer Security – ESORICS 2020 (Vol. I, pp. 654-673). Springer. https://doi.org/10.1007/978-3-030-59013-0_32

Aranha, D. F., Orlandi, C., Takahashi, A. & Zaverucha, G. (2020). Security of Hedged Fiat–Shamir Signatures under Fault Attacks. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 (pp. 644-674). Springer. https://doi.org/10.1007/978-3-030-45721-1_23

Fehér, M., Yazdani, N., Aranha, D. F., Lucani Rötter, D. E., Hansen, M. T. & Vester, F. E. (2020). Side Channel Security of Smart Meter Data Compression Techniques. In 2020 IEEE International Conference on Communications, Control, and Computing Technologies for Smart Grids, SmartGridComm 2020: Proceedings Article 9302931 IEEE. https://doi.org/10.1109/SmartGridComm47815.2020.9302931

Damgård, I., Haagh, H., Mercer, R., Nitulescu, A., Orlandi, C. & Yakoubov, S. (2020). Stronger Security and Constructions of Multi-designated Verifier Signatures. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings: Proceedings (Vol. II, pp. 229-260). Springer. https://doi.org/10.1007/978-3-030-64378-2_9

Blatchley Hansen, A., Eskilden, M. & Nielsen, E. H. (2020). Toolchain for Timing Leakage Analysis of NIST Lightweight Crypto Candidates. Abstract from NIST Lightweight Cryptography Workshop 2020. https://csrc.nist.gov/CSRC/media/Events/lightweight-cryptography-workshop-2020/documents/papers/toolchain-timing-leakage-lwc2020.pdf

Kulik, T., Boudjadar, J. & Aranha, D. F. (2020). Towards Formally Verified Key Management for Industrial Control Systems. 119-129. Paper presented at 8th International Conference on Formal Methods in Software Engineering, Seoul, Korea, Republic of. https://doi.org/10.1145/3372020.3391555

Eerikson, H., Keller, M., Orlandi, C., Pullonen, P., Puura, J. & Simkin, M. (2020). Use your brain! Arithmetic 3PC for any modulus with active security. In Y. T. Kalai, A. D. Smith & D. Wichs (Eds.), 1st Conference on Information-Theoretic Cryptography (ITC 2020) Article 5 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ITC.2020.5

Abdolmaleki, B., Khoshakhlagh, H. & Slamanig, D. (2019). A Framework for UC-Secure Commitments from Publicly Computable Smooth Projective Hashing. In M. Albrecht (Ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings (pp. 1-21). Springer. https://doi.org/10.1007/978-3-030-35199-1_1

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

Hoffman, C., Gebotys, C. H., Aranha, D. F., Cortes, M. L. & Araujo, G. (2019). Circumventing Uniqueness of XOR Arbiter PUFs. In Proceedings - Euromicro Conference on Digital System Design, DSD 2019 (pp. 222-229). Article 8875236 IEEE. https://doi.org/10.1109/DSD.2019.00041

Damgård, I. B., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. Cryptology ePrint Archive.

Damgård, I., Haagh, H., Nielsen, M. & Orlandi, C. (2019). Commodity-Based 2PC for Arithmetic Circuits. In M. Albrecht (Ed.), Cryptography and Coding - 17th IMA International Conference, IMACC 2019, Proceedings (pp. 154-177). Springer. https://doi.org/10.1007/978-3-030-35199-1_8

Damgård, I., Larsen, K. G. & Nielsen, J. B. (2019). Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (Vol. II, pp. 61-84). Springer. https://doi.org/10.1007/978-3-030-26951-7_3

Faonio, A., Buus Nielsen, J., Simkin, M. & Venturi, D. (2019). Continuously non-malleable codes with split-state refresh. Theoretical Computer Science, 759, 98-132. https://doi.org/10.1016/j.tcs.2018.12.028

Abspoel, M., Cramer, R., Damgård, I. B., Escudero Ospina, D. E. & Yuan, C. (2019). Efficient Information-Theoretic Secure Multiparty Computation over Z/p^k Z via Galois Rings. In D. Hofheinz & A. Rosen (Eds.), Theory of Cryptography - 17th International Conference, TCC 2019, Proceedings: Proceedings (Vol. Part 1, pp. 471-501). Springer. https://doi.org/10.1007/978-3-030-36030-6_19

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2019). Efficient Pseudorandom Correlation Generators: Silent OT Extension and More. In D. Micciancio & A. Boldyreva (Eds.), Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings: CRYPTO 2019 (pp. 489-518). Springer. https://doi.org/10.1007/978-3-030-26954-8_16

Hazay, C., Mikkelsen, G. L., Rabin, T., Toft, T. & Nicolosi, A. A. (2019). Efficient RSA Key Generation and Threshold Paillier in the Two-Party Setting. Journal of Cryptology, 32(2), 265-323. https://doi.org/10.1007/s00145-017-9275-7

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Rindal, P. & Scholl, P. (2019). Efficient Two-Round OT Extension and Silent Non-Interactive Secure Computation. In L. Cavallaro, J. Kinder, X. Wang & J. Katz (Eds.), CCS 2019 - Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security (pp. 291-308). Association for Computing Machinery. https://doi.org/10.1145/3319535.3354255

Cascudo, I., Damgård, I., David, B., Döttling, N., Dowsley, R. & Giacomelli, I. (2019). Efficient UC Commitment Extension with Homomorphism for Free (and Applications). 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 (pp. 606-635). Springer. https://doi.org/10.1007/978-3-030-34621-8_22

Boyle, E., Kohl, L. & Scholl, P. (2019). Homomorphic Secret Sharing from Lattices Without FHE. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings: EUROCRYPT 2019 (pp. 3-33). Springer VS. https://doi.org/10.1007/978-3-030-17656-3_1

Guimaraes, A., Borin, E. & Aranha, D. F. (2019). Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography. In M. Baldi, E. Persichetti & P. Santini (Eds.), Code-Based Cryptography - 7th International Workshop, CBC 2019, Revised Selected Papers (pp. 44-68). Springer. https://doi.org/10.1007/978-3-030-25922-8_3

Jacob, R., Larsen, K. G. & Nielsen, J. B. (2019). Lower Bounds for Oblivious Data Structures. In T. M. Chan (Ed.), Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2439-2447). Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611975482.149

Damgård, I. B., Escudero Ospina, D. E., Frederiksen, T. K., Keller, M., Scholl, P. & Volgushev, N. (2019). New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning. In Proceedings - 2019 IEEE Symposium on Security and Privacy, SP 2019 (pp. 1102-1120). Article 8835310 IEEE. https://doi.org/10.1109/SP.2019.00078

Matias, P., Y. S. Barbosa, P., N. C. Cardoso, T., Mariano, D. & Aranha, D. F. (2019). NIZKCTF: A Non-Interactive Zero-Knowledge Capture the Flag Platform. IEEE Security & Privacy, 16(6), 42-51. Article 8636460. https://doi.org/10.1109/MSEC.2018.2875324

Guimaraes, A., Aranha, D. F. & Borin, E. (2019). Optimized implementation of QC‐MDPC code‐based cryptography. Concurrency and Computation: Practice & Experience, 31(18), Article e5089. https://doi.org/10.1002/cpe.5089

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

Ganesh, C., Orlandi, C. & Tschudi, D. (2019). Proof-of-Stake Protocols for Privacy-Aware Blockchains. In Y. Ishai & V. Rijmen (Eds.), Advances in Cryptology – EUROCRYPT 2019 - 38th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 690-719). Springer. https://doi.org/10.1007/978-3-030-17653-2_23

Damgård, I. B., Ganesh, C. & Orlandi, C. (2019). Proofs of Replicated Storage Without Timing Assumptions. In Advances in Cryptology – CRYPTO 2019 - 39th Annual International Cryptology Conference, Proceedings (pp. 355-380). Springer. https://doi.org/10.1007/978-3-030-26948-7_13

Fauzi, P. M., Meiklejohn, S., Mercer, R. H. & Orlandi, C. (2019). Quisquis: A New Design for Anonymous Cryptocurrencies. In Advances in Cryptology – ASIACRYPT 2019 (pp. 649-678) https://doi.org/10.1007/978-3-030-34578-5

Barcellos, M. & Aranha, D. F. (2019). Research in Security and Privacy in Brazil. IEEE Security & Privacy, 16(6), 14-21. Article 8636416. https://doi.org/10.1109/MSEC.2018.2874855

Branzei, S., Orlandi, C. & Yang, G. (2019). Sharing Information with Competitors. In D. Fotakis & E. Markakis (Eds.), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings: SAGT 2019 (pp. 34-48). Springer. https://doi.org/10.1007/978-3-030-30473-7

Aggarwal, D., Damgård, I., Nielsen, J. B., Obremski, M., Purwanto, E., Ribeiro, J. & Simkin, M. (2019). Stronger leakage-resilient and non-malleable secret sharing schemes for general access structures. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019 : 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Vol. II, pp. 510-539). Springer. https://doi.org/10.1007/978-3-030-26951-7_18

Ghosh, S. & Simkin, M. (2019). The Communication Complexity of Threshold Private Set Intersection. In A. Boldyreva & D. Micciancio (Eds.), Advances in Cryptology – CRYPTO 2019: 39th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18–22, 2019, Proceedings (Vol. II, pp. 3-29). Springer. https://doi.org/10.1007/978-3-030-26951-7_1

Aranha, D. F. & van de Graaf, J. (2019). The Good, the Bad, and the Ugly: Two Decades of E-Voting in Brazil. IEEE Security & Privacy, 16(6), 22-30. Article 8636417. https://doi.org/10.1109/MSEC.2018.2875318

Aranha, D. F., Barbosa, P. Y. S., Cardoso, T. N. C., Araújo, C. L. & Matias, P. (2019). The return of software vulnerabilities in the Brazilian voting machine. Computers & Security, 86, 335-349. https://doi.org/10.1016/j.cose.2019.06.009

Aranha, D. F. & Pagnin, E. (2019). The simplest multi-key linearly homomorphic signature scheme. In P. Schwabe & N. Thériault (Eds.), Progress in Cryptology – LATINCRYPT 2019 (pp. 280-300). Springer. https://doi.org/10.1007/978-3-030-30530-7_14

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

Alves, P. G. M. R. & Aranha, D. F. (2018). A framework for searching encrypted databases. Journal of Internet Services and Applications, 9(1), Article 1. https://doi.org/10.1186/s13174-017-0073-0

Dalskov, A. P. K. & Orlandi, C. (2018). Can You Trust Your Encrypted Cloud?: An Assessment of SpiderOakONE's Security. In J. Kim, G.-J. Ahn & S. Kim (Eds.), ASIACCS 2018 - Proceedings of the 2018 ACM Asia Conference on Computer and Communications Security (pp. 343-355). Association for Computing Machinery. https://doi.org/10.1145/3196494.3196547

Ciampi, M. & Orlandi, C. (2018). Combining Private Set-Intersection with Secure Two-Party Computation. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 464-482). Springer VS. https://doi.org/10.1007/978-3-319-98113-0

Damgård, I., Luo, J., Oechsner, S., Scholl, P. & Simkin, M. (2018). Compact Zero-Knowledge Proofs of Small Hamming Weight. In M. Abdalla & R. Dahab (Eds.), Public-Key Cryptography - PKC 2018 - 21st IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Vol. 10770, pp. 530-560). Springer VS. https://doi.org/10.1007/978-3-319-76581-5_18

Hazay, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2018). Concretely Efficient Large-Scale MPC with Active Security (or, TinyKeys for TinyOT). In T. Peyrin & S. Galbraith (Eds.), Advances in Cryptology – ASIACRYPT 2018 - 24th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 11274, pp. 86-117). Springer VS. https://doi.org/10.1007/978-3-030-03332-3_4

Faonio, A., Nielsen, J. B., Simkin, M. & Venturi, D. (2018). Continuously Non-malleable Codes with Split-State Refresh. In B. Preneel & F. Vercauteren (Eds.), Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (Vol. 10892, pp. 121-139). Springer VS. https://doi.org/10.1007/978-3-319-93387-0_7

Damgård, I., Kazana, T., Obremski, M., Raj, V. & Siniscalchi, L. (2018). Continuous NMC Secure Against Permutations and Overwrites, with Applications to CCA Secure Commitments. In A. Beimel & S. Dziembowski (Eds.), Theory of Cryptography - 16th International Conference, TCC 2018, Proceedings (Vol. 11240, pp. 225-254). Springer VS. https://doi.org/10.1007/978-3-030-03810-6_9

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

Fleischhacker, N., Krupp, J., Malavolta, G., Schneider, J., Schröder, D. & Simkin, M. (2018). Efficient unlinkable sanitizable signatures from signatures with re-randomizable keys. IET Information Security, 12(3), 166-183. https://doi.org/10.1049/iet-ifs.2017.0041

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

Davi Resende, A. C. & Aranha, D. F. (2018). Faster Unbalanced Private Set Intersection. In S. Meiklejohn & K. Sako (Eds.), Financial Cryptography and Data Security - 22nd International Conference, FC 2018, Revised Selected Papers: 22nd International Conference, FC 2018, Nieuwpoort, Curaçao, February 26 – March 2, 2018, Revised Selected Papers (1 ed., pp. 203-221). Springer. https://doi.org/10.1007/978-3-662-58387-6

Displaying results 201 to 250 out of 592

Revised 02.09.2025

Marianne Dammand Iversen