Publications

List of publications

Sort by: Date | Author | Title

Brandt, J., Damgård, I. B. & Landrock, P. (1988). Anonymous and verifiable registration in databases. In Advances in cryptology - EUROCRYPT '88 (pp. 167-176). Springer. https://doi.org/10.1007/3-540-45961-8_14

Brandt, J., Damgård, I. B., Landrock, P. & Pedersen, T. P. (1988). Zero-Knowledge Authentication Scheme with Secret Key Exchange (extended abstract). In S. Goldwasser (Ed.), Advances in Cryptology - CRYPTO' 88: Proceedings (pp. 583-588). Springer. https://doi.org/10.1007/0-387-34799-2_43

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

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

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

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

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Efficient pseudorandom correlation generators from ring-lpn. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 387-416). Springer. https://doi.org/10.1007/978-3-030-56880-1_14

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2020). Correlated Pseudorandom Functions from Variable-Density LPN. In S. Irani (Ed.), Proceedings - 2020 IEEE 61st Annual Symposium on Foundations of Computer Science, FOCS 2020 (pp. 1069-1080). Article 9317926 IEEE. https://doi.org/10.1109/FOCS46700.2020.00103

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L. & Scholl, P. (2021). Low-Complexity Weak Pseudorandom Functions in textdollartextbackslashmathtt AC0[textbackslashmathtt MOD2]textdollar. In T. Malkin & C. Peikert (Eds.), Advances in Cryptology – CRYPTO 2021: 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part IV (pp. 487-516). Springer. https://doi.org/10.1007/978-3-030-84259-8_17

Boyle, E., Couteau, G., Gilboa, N., Ishai, Y., Kohl, L., Resch, N. & Scholl, P. (2022). Correlated Pseudorandomness from Expand-Accumulate Codes. In Y. Dodis & T. Shrimpton (Eds.), Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 603-633). Springer. https://doi.org/10.1007/978-3-031-15979-4_21

Boyar, J., Chaum, D., Damgård, I. B. & Pedersen, T. (1990). Convertible Undeniable Signatures. In A. J. Menezez & S. A. Vanstone (Eds.), Advances in Cryptology - CRYPT0' 90: Proceedings (pp. 189-205). Springer. https://doi.org/10.1007/3-540-38424-3_14

Boyar, J., Damgård, I. B. & Peralta, R. (2000). Short Non-Interactive Cryptographic Proofs. Journal of Cryptology, 13(4), 449-472. https://doi.org/10.1007/s001450010011

Boudgoust, K., Jeudy, C., Roux-Langlois, A. & Wen, W. (2023). On the Hardness of Module Learning with Errors with Short Distributions. Journal of Cryptology, 36(1), Article 1. https://doi.org/10.1007/s00145-022-09441-3

Boudgoust, K., Sakzad, A. & Steinfeld, R. (2022). Vandermonde meets Regev: public key encryption schemes based on partial Vandermonde problems. Designs, Codes and Cryptography, 90(8), 1899-1936. https://doi.org/10.1007/s10623-022-01083-7

Boudgoust, K., Gachon, E. & Pellet-Mary, A. (2022). Some Easy Instances of Ideal-SVP and Implications on the Partial Vandermonde Knapsack Problem. In Advances in Cryptology – CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Proceedings (pp. 480-509). Springer. https://doi.org/10.1007/978-3-031-15979-4_17

Boschini, C., Damgård, I. & Orlandi, C. (2022). On Access Control Encryption Without Sanitization. In C. Galdi & S. Jarecki (Eds.), Security and Cryptography for Networks. SCN 2022 (pp. 220-243). Springer. https://doi.org/10.1007/978-3-031-14791-3_10

Bøgetoft, P., Lund Christensen, D., Damgård, I. B., Geisler, M., Jacobsen, T., Krøigaard, M., Nielsen, J. D., Nielsen, J. B., Nielsen, K., Pagter, J. I., Schwartzbach, M. I., Toft, T. & Nielsen, K. (2009). Secure Multiparty Computation Goes Live. Lecture Notes in Computer Science, 5628, 325-343. https://doi.org/10.1007/978-3-642-03549-4_20

Bogdanov, D., Niitsoo, M., Toft, T. & Willemson, J. (2012). High-performance secure multi-party computation for data mining applications. International Journal of Information Security, 11(6), 403-418 . https://doi.org/10.1007/s10207-012-0177-2

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

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

Blundo, C., Cimato, S. & Siniscalchi, L. (2022). Role Mining Heuristics for Permission-Role-Usage Cardinality Constraints. Computer Journal, 65(6), 1386-1411. https://doi.org/10.1093/comjnl/bxaa186

Blundo, C., Cimato, S. & Siniscalchi, L. (2023). Heuristics for constrained role mining in the post-processing framework. Journal of Ambient Intelligence and Humanized Computing, 14(8), 9925-9937. https://doi.org/10.1007/s12652-021-03648-1

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

Ben-Sasson, E., Ben-Tov, I., Damgård, I., Ishai, Y. & Ron-Zewi, N. (2016). On public key encryption from noisy codewords. In Public-Key Cryptography – PKC 2016 - 19th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 9615, pp. 417-446). Springer VS. https://doi.org/10.1007/978-3-662-49387-8_16

Bendlin, R. & Damgård, I. B. (2010). Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems. Lecture Notes in Computer Science, 5978, 201-218. https://doi.org/10.1007/978-3-642-11799-2_13

Bendlin, R., Damgård, I. B., Orlandi, C. & Zakarias, S. N. H. (2011). Semi-Homomorphic Encryption and Multiparty Computation. Lecture Notes in Computer Science, 6632, 169-188. https://doi.org/10.1007/978-3-642-20465-4_11

Bendlin, R., Nielsen, J. B., Nordholt, P. S. & Orlandi, C. (2011). Lower and Upper Bounds for Deniable Public-Key Encryption. Lecture Notes in Computer Science, 7073, 125-142. https://doi.org/10.1007/978-3-642-25385-0_7

Bendlin, R. (2013). Lattice-based Cryptography: Threshold Protocols and Multiparty Computation. Department of Computer Science, Aarhus University.

Bendlin, R., Peikert, C. & Krehbiel, S. (2013). How to Share a Lattice Trapdoor: Threshold Protocols for Signatures and (H)IBE. In 11th International Conference on Applied Cryptography and Network Security, ACNS 2013 (Vol. 7954, pp. 218-236). Springer VS. https://doi.org/10.1007/978-3-642-38980-1_14

Benarroch, D., Campanelli, M., Fiore, D., Gurkan, K. & Kolonelos, D. (2021). Zero-Knowledge Proofs for Set Membership: Efficient, Succinct, Modular. In N. Borisov & C. Diaz (Eds.), Financial Cryptography and Data Security: 25th International Conference, FC 2021, Virtual Event, March 1–5, 2021, Revised Selected Papers, Part I (pp. 393-414). Springer. https://doi.org/10.1007/978-3-662-64322-8_19

Beerliová-Trubíniová, Z., Hirt, M. & Nielsen, J. B. (2010). On the theoretical gap between synchronous and asynchronous MPC protocols. In A. Richa & R. Guerraoui (Eds.), Proceeding of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing. PODC '10 (pp. 211-218). Association for Computing Machinery. https://doi.org/10.1145/1835698.1835746

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. https://doi.org/10.1007/978-3-319-10879-7_11

Baum, C., Damgård, I. B., Toft, T. & Zakarias, R. W. (2016). Better Preprocessing for Secure Multiparty Computation. In M. Manulis, A-R. Sadeghi & S. Schneider (Eds.), Applied Cryptography and Network Security - 14th International Conference, ACNS 2016, Proceedings: 14th International Conference on Applied Cryptography and Network Security (Vol. 9696, pp. 327-345). Springer VS. https://doi.org/10.1007/978-3-319-39555-5_18

Baum, C., Damgård, I. B., Larsen, K. G. & Nielsen, M. (2016). How to prove knowledge of small secrets. In J. Katz & M. Robshaw (Eds.), Advances in Cryptology - 36th Annual International Cryptology Conference, CRYPTO 2016, Proceedings: CRYPTO 2016: Advances in Cryptology – CRYPTO 2016 (Vol. 9816, pp. 478-498). Springer VS. https://doi.org/10.1007/978-3-662-53015-3_17

Baum, C. (2016). On Garbling Schemes with and Without Privacy. In V. Zikas & R. De Prisco (Eds.), Security and Cryptography for Networks - 10th International Conference, SCN 2016, Proceedings: International Conference on Security and Cryptography for Networks (Vol. 9841, pp. 468-485). Springer VS. https://doi.org/10.1007/978-3-319-44618-9

Baum, C., Scholl, P. & Orsini, E. (2016). Efficient Secure Multiparty Computation with Identifiable Abort. In M. Hirt & A. Smith (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings: Fourteenth IACR Theory of Cryptography Conference, TCC 2016-B (Vol. 9985, pp. 461-469). Springer VS. https://doi.org/10.1007/978-3-662-53641-4

Baum, C. (2016). Towards More Efficient Secure Multiparty Computation in the Preprocessing Model. Department of Computer Science, Aarhus University.

Baum, C., Damgård, I., Lyubashevsky, V., Oechsner, S. & Peikert, C. (2018). More Efficient Commitments from Structured Lattice Assumptions. In D. Catalano & R. De Prisco (Eds.), Security and Cryptography for Networks - 11th International Conference, SCN 2018, Proceedings (Vol. 11035, pp. 368-385). Springer VS. https://doi.org/10.1007/978-3-319-98113-0_20

Baum, C., Lin, H. & Oechsner, S. (2018). Towards Practical Lattice-Based One-Time Linkable Ring Signatures. In D. Naccache, S. Xu, S. Qing, P. Samarati, G. Blanc, R. Lu, Z. Zhang & A. Meddahi (Eds.), Information and Communications Security - 20th International Conference, ICICS 2018, Proceedings: ICICS 2018 (Vol. 11149, pp. 303-322). Springer VS. https://doi.org/10.1007/978-3-030-01950-1_18

Baum, C., Lyubashevsky, V., Groth, J., Bootle, J., Cerulli, A. & del Pino, R. (2018). Sub-Linear Lattice-Based Zero-Knowledge Arguments for Arithmetic Circuits. In Advances in Cryptology – CRYPTO 2018 - 38th Annual International Cryptology Conference, 2018, Proceedings (pp. 669-699) https://doi.org/10.1007/978-3-319-96881-0_23

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

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

Baum, C. & Nof, A. (2020). Concretely-Efficient Zero-Knowledge Arguments for Arithmetic Circuits and Their Application to Lattice-Based Cryptography. In A. Kiayias, M. Kohlweiss, P. Wallden & V. Zikas (Eds.), Public-Key Cryptography – PKC 2020 - 23rd IACR International Conference on Practice and Theory of Public-Key Cryptography, Proceedings (Vol. 1, pp. 495-526). Springer. https://doi.org/10.1007/978-3-030-45374-9_17

Baum, C., Orsini, E., Scholl, P. & Soria-Vazquez, E. (2020). Efficient constant-round mpc with identifiable abort and public verifiability. In D. Micciancio & T. Ristenpart (Eds.), Advances in Cryptology - CRYPTO 2020 (pp. 562-592). Springer. https://doi.org/10.1007/978-3-030-56880-1_20

Baum, C., Escudero, D., Pedrouzo-Ulloa, A., Scholl, P. & Troncoso-Pastoriza, J. R. (2020). Efficient protocols for oblivious linear function evaluation from ring-LWE. In C. Galdi & V. Kolesnikov (Eds.), Security and Cryptography for Networks (pp. 130-149). Springer. https://doi.org/10.1007/978-3-030-57990-6_7

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

Baum, C., de Saint Guilhem, C. D., Kales, D., Orsini, E., Scholl, P. & Zaverucha, G. (2021). Banquet: Short and Fast Signatures from AES. 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 I (pp. 266-297). Springer. https://doi.org/10.1007/978-3-030-75245-3_11

Baum, C., Braun, L., Munch-Hansen, A., Razet, B. & Scholl, P. (2021). Appenzeller to Brie: Efficient Zero-Knowledge Proofs for Mixed-Mode Arithmetic and Z2k. In CCS 2021 - Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security (pp. 192-211). Association for Computing Machinery. https://doi.org/10.1145/3460120.3484812

Baum, C., David, B. & Frederiksen, T. K. (2021). P2DEX: Privacy-Preserving Decentralized Cryptocurrency Exchange. In K. Sako & N. O. Tippenhauer (Eds.), Applied Cryptography and Network Security - 19th International Conference, ACNS 2021, Proceedings (pp. 163-194). Springer. https://doi.org/10.1007/978-3-030-78372-3_7

Baum, C., Malozemoff, A. J., Scholl, P. & Rosen, M. (2021). Mac’n’Cheese: Zero-Knowledge Proofs for Boolean and Arithmetic Circuits with Nested Disjunctions. In Advances in Cryptology – CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Proceedings: Proceedings (pp. 92-122). Springer. https://doi.org/10.1007/978-3-030-84259-8_4

Displaying results 501 to 550 out of 624

Revised 04.10.2023

Marianne Dammand Iversen