Publications

List of publications

Campanelli, M., Fiore, D., Greco, N., Kolonelos, D. & Nizzardo, L. (2020). Incrementally Aggregatable Vector Commitments and Applications to Verifiable Decentralized Storage. In S. Moriai & H. Wang (Eds.), Advances in Cryptology – ASIACRYPT 2020 - 26th International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (pp. 3-35). Springer. https://doi.org/10.1007/978-3-030-64834-3_1

Baum, C., David, B. & Dowsley, R. (2020). Insured MPC: Efficient Secure Computation with Financial Penalties. In J. Bonneau & N. Heninger (Eds.), Financial Cryptography and Data Security: FC 2020 (pp. 404-420). Springer. https://doi.org/10.1007/978-3-030-51280-4_22

Aranha, D. F., Novaes, F. R., Takahashi, A., Tibouchi, M. & Yarom, Y. (2020). LadderLeak: Breaking ECDSA with Less than One Bit of Nonce Leakage. In CCS 2020 - Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security: Proceedings of the 2020 ACM SIGSAC Conference on Computer and Communications Security (pp. 225-242). Association for Computing Machinery. https://doi.org/10.1145/3372297.3417268

Hazay, C., Scholl, P. & Soria-Vazquez, E. (2020). Low Cost Constant Round MPC Combining BMR and Oblivious Transfer. Journal of Cryptology, 33(4), 1732-1786. https://doi.org/10.1007/s00145-020-09355-y

Nielsen, J. B. & Simkin, M. (2020). Lower bounds for leakage-resilient secret sharing. In A. Canteaut & Y. Ishai (Eds.), Advances in Cryptology – EUROCRYPT 2020 - 39th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Proceedings (pp. 556-577). Springer. https://doi.org/10.1007/978-3-030-45721-1_20

Larsen, K. G., Simkin, M. & Yeo, K. (2020). Lower Bounds for Multi-server Oblivious RAMs. In R. Pass & K. Pietrzak (Eds.), Theory of Cryptography - 18th International Conference, TCC 2020, Proceedings (pp. 486-503). Springer. https://doi.org/10.1007/978-3-030-64375-1_17

Blundo, C., Cimato, S. & Siniscalchi, L. (2020). Managing Constraints in Role Based Access Control. IEEE Access, 8, 140497-140511. Article 9146129. https://doi.org/10.1109/ACCESS.2020.3011310

Deuber, D., Döttling, N., Magri, B., Malavolta, G. & Thyagarajan, S. A. K. (2020). Minting Mechanism for Proof of Stake Blockchains. In M. Conti, J. Zhou, E. Casalicchio & A. Spognardi (Eds.), Applied Cryptography and Network Security (pp. 315-334). Springer. https://doi.org/10.1007/978-3-030-57808-4_16

Brian, G., Faonio, A., Obremski, M., Simkin, M. & Venturi, D. (2020). Non-malleable secret sharing against bounded joint-tampering attacks in the plain model. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 127-155). Springer. https://doi.org/10.1007/978-3-030-56877-1_5

Brandt, M., Orlandi, C., Shrishak, K. & Shulman, H. (2020). Optimal Transport Layer for Secure Computation. In P. Samarati, S. D. C. D. Vimercati, M. S. Obaidat & J. Ben-Othman (Eds.), ICETE 2020 - Proceedings of the 17th International Joint Conference on e-Business and Telecommunications (Vol. Volume 3: SECRYPT, pp. 130-141). SCITEPRESS Digital Library. https://doi.org/10.5220/0009826801300141

Baum, C., Frederiksen, T. K., Hesse, J., Lehmann, A. & Yanai, A. (2020). Pesto: Proactively secure distributed single sign-on, or how to trust a hacked server. In Proceedings - 5th IEEE European Symposium on Security and Privacy, Euro S and P 2020 (pp. 587-606). Article 9230400 IEEE. https://doi.org/10.1109/EuroSP48549.2020.00044

Díaz Cardell, S., Aranha, D. F. & Fuster-Sabater, A. (2020). Recovering decimation-based cryptographic sequences by means of linear CAs. Logic Journal of the IGPL, 28(4), 430–448. https://doi.org/10.1093/jigpal/jzz051

Chakraborty, S., Dziembowski, S. & Nielsen, J. B. (2020). Reverse firewalls for actively secure mpcs. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 732-762). Springer. https://doi.org/10.1007/978-3-030-56880-1_26

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

Dalskov, A. P. K., Escudero Ospina, D. E. & Keller, M. (2020). Secure Evaluation of Quantized Neural Networks. Proceedings on Privacy Enhancing Technologies, 2020(4), 355-375. https://doi.org/10.2478/popets-2020-0077

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

Ateniese, G., Magri, B. & Venturi, D. (2020). Subversion-resilient signatures: Definitions, constructions and applications. Theoretical Computer Science, 820, 91-122. https://doi.org/10.1016/j.tcs.2020.03.021

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

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

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 Schloss Dagstuhl--Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2020.5

Baum, C., Cozzo, D. & P. Smart, N. (2020). Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ. In K. G. Paterson & D. Stebila (Eds.), Selected Areas in Cryptography – SAC 2019 - 26th International Conference, Revised Selected Papers: 26th International Conference, Waterloo, ON, Canada, August 12–16, 2019, Revised Selected Papers (pp. 274-302). Springer. https://doi.org/10.1007/978-3-030-38471-5_12

Gregersen, S. O., Thomsen, S. E. & Askarov, A. (2019). A Dependently Typed Library for Static Information-Flow Control in IDRIS. In F. Nielson & D. Sands (Eds.), Principles of Security and Trust: 8th International Conference, POST 2019, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2019, Proceedings (pp. 51-75). Springer. https://doi.org/10.1007/978-3-030-17138-4_3

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

Ghosh, S. & Nilges, T. (2019). An algebraic approach to maliciously secure private set intersection. 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. 154-185). Springer VS. https://doi.org/10.1007/978-3-030-17659-4_6

Blundo, C., Maio, C. D., Parente, M. & Siniscalchi, L. (2019). An intelligent and private method to profile social network users. In 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) (Vol. June 2019 , pp. 1-6). IEEE. https://doi.org/10.1109/FUZZ-IEEE.2019.8858912

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

Oechsner, S. (2019). Constructions and Proof Techniques for Secure Computation. Århus Universitet.

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

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

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

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

Displaying results 201 to 250 out of 669

Revised 02.09.2024

Marianne Dammand Iversen