Find

For students
For PhDs
For employees

Department of Computer Science

Publications

List of publications

Sort by: Date | Author | Title

Pasquini, D., Francati, D. & Ateniese, G. (2022). Eluding Secure Aggregation in Federated Learning via Model Inconsistency. In CCS 2022 - Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security (pp. 2429-2443). Association for Computing Machinery. https://doi.org/10.1145/3548606.3560557

Pagter, J. I. (2001). Time-Space Trade-Offs. (BRICS Dissertation Series DS-01-2 ed.) University of Aarhus.

Pagter, J. I. (2005). On Ajtai’s Lower Bound Technique for R-way Branching Programs and the Hamming Distance Problem. Chicago Journal of Theoretical Computer Science.

Pagter, J. I. & Arge, L. (2000). I/O-Space Trade-Offs: Extended Abstract. In Algorithm Theory - SWAT 2000: 7th Scandinavian Workshop on Algorithm Theory Bergen, Norway, July 5-7, 2000 Proceedings (pp. 509-514). Springer. https://doi.org/10.1007/3-540-44985-X_38

Pagter, J. I. & Rauhe, T. (1998). Optimal Time-Space Trade-Offs for Sorting. In Proc. of 39th Annual Symposium on Foundations of Computer Science (FOCS '98) IEEE. https://doi.org/10.1109/SFCS.1998.743455

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. B R I C S 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

Pagh, R. & Pagter, J. (2001). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. B R I C S Report Series, (RS-01-2), 20-20.

Pagh, R., Pagter, J. I. & Eppstein, D. (Ed.) (2002). Optimal Time-Space Trade-Offs for Non-Comparison-Based Sorting. In Symposium on Discrete Algorithm: Proceedings of the thirteenth annual ACM-SIAM symposium on Discrete algorithms (pp. 9-18). Association for Computing Machinery.

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. (2011). Secure Computation in Untrusted Environments. Department of Computer Science, Aarhus University.

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

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

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

Nordholt, P. S. (2013). New Approaches to Practical Secure Two-Party Computation. Institut for Datalogi, Aarhus Universitet.

Nordholt, P. S. & Veeningen, M. (2018). Minimising Communication in Honest-Majority MPC by Batchwise Multiplication Verification. In Applied Cryptography and Network Security - 16th International Conference, ACNS 2018, Proceedings (pp. 321-339) https://eprint.iacr.org/2018/474.pdf

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

Nielsen, J. B. (2002). A Threshold Pseudorandom Function Construction and Its Applications. In M. Yung (Ed.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (pp. 43-59). Springer. https://doi.org/10.1007/3-540-45708-9_26

Nielsen, J. B. (2001). Non-Committing Encryption is Too Easy in the Random Oracle Model. B R I C S Report Series, (RS-01-47).

Nielsen, J. B. (2003). On Protocol Security in the Cryptographic Model. (BRICS Dissertation Series DS-03-8 ed.) Afdeling for Kunsthistorie, Institut for Æstetiske Fag, Aarhus Universitet.

Nielsen, J. B. (2002). Separating Random Oracle Proofs from Complexity Theoretic Proofs: The Non-Committing Encryption Case. In M. Yung (Ed.), Advances in Cryptology — CRYPTO 2002: 22nd Annual International Cryptology Conference Santa Barbara, California, USA, August 18–22, 2002 Proceedings (pp. 191-214). Springer. https://doi.org/10.1007/3-540-45708-9_8

Nielsen, P. M., Schori, C., Sørensen, J. L., Salvail, L., Damgård, I. B. & Polzik, E. S. (2001). Experimental quantum key distribution with proven security against realistic attacks. Journal of Modern Optics, 48, 1921-1942.

Nielsen, J. B. (Ed.), Alwen, J., Cachin, C., Pereira, O., Sadeghi, A-R., Schoenmakers, B., Shelat, A. & Visconti, I. (2007). Summary Report on Rational Cryptographic Protocols. ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. (Ed.), Damgård, I. B., Salvail, L. & Cachin, C. (2006). Summary Report on Unconditionally Secure Protocols. (pp. 1- 25). ECRYPT - European Network of Excellence in Cryptology.

Nielsen, J. B. & Orlandi, C. (2009). LEGO for Two-Party Secure Computation. Lecture Notes in Computer Science, 5444, 368-386. https://doi.org/10.1007/978-3-642-00457-5_22

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2011). A New Approach to Practical Active-Secure Two-Party Computation. http://eprint.iacr.org/2011/091

Nielsen, J. B., Nordholt, P. S., Orlandi, C. & Burra, S. S. (2012). A New Approach to Practical Active-Secure Two-Party Computation. Lecture Notes in Computer Science, 7417, 681-700 . https://doi.org/10.1007/978-3-642-32009-5_40

Nielsen, J. B., Venturi, D. & Zottarel, A. (2013). On the Connection between Leakage Tolerance and Adaptive Security. In K. Kurosawa & G. Hanaoka (Eds.), Public-Key Cryptography – PKC 2013: 16th International Conference on Practice and Theory in Public-Key Cryptography, Nara, Japan, February 26 – March 1, 2013. Proceedings (pp. 497-515 ). Springer VS. https://doi.org/10.1007/978-3-642-36362-7_30

Nielsen, J. B., Venturi, D. & Zottarel, A. (2014). Leakage-resilient signatures with graceful degradation. In H. Krawczyk (Ed.), Public-Key Cryptography – PKC 2014: 17th International Conference on Practice and Theory in Public-Key Cryptography, Buenos Aires, Argentina, March 26-28, 2014. Proceedings (pp. 362-379). Springer. https://doi.org/10.1007/978-3-642-54631-0_21

Nielsen, J. B. (2015). Tamper and leakage resilient von Neumann architectures from continuous non-malleable codes. In S. Wolf & A. Lehmann (Eds.), 8th International Conference on Information Theoretic Security, ICITS 2015 (Vol. 9063, pp. XI-XII). Springer.

Nielsen, J. B. & Orlandi, C. (2016). Cross and Clean: Amortized Garbled Circuits with Constant Overhead. In M. Hirt & A. Smith (Eds.), Theory of Cryptography - 14th International Conference, TCC 2016-B, Proceedings (Vol. 9985, pp. 582-603). Springer VS. https://doi.org/10.1007/978-3-662-53641-4_22

Nielsen, J. B. & Ranellucci, S. (2016). Reactive garbling: Foundation, instantiation, application. In J. H. Cheon & T. Takagi (Eds.), Advances in Cryptology - ASIACRYPT 2016 - 22nd International Conference on the Theory and Application of Cryptology and Information Security, Proceedings (Vol. 10032, pp. 1022-1052). Springer VS. https://doi.org/10.1007/978-3-662-53890-6_34

Nielsen, J. B. & Ranellucci, S. (2016). On the Computational Overhead of MPC with Dishonest Majority. http://eprint.iacr.org/2016/643

Nielsen, J. B., Schneider, T. & Trifiletti, R. (2017). Constant Round Maliciously Secure 2PC with Function-independent Preprocessing using LEGO. In NDSS ’17 (pp. 1-15). Internet Society. https://doi.org/10.14722/ndss.2017.23075

Nielsen, J. B. & Ranellucci, S. (2017). On the computational overhead of MPC with dishonest majority. In S. Fehr (Ed.), Public-Key Cryptography – PKC 2017 - 20th IACR International Conference on Practice and Theory in Public-Key Cryptography, Proceedings (Vol. 10175, pp. 369-395). Springer VS. https://doi.org/10.1007/978-3-662-54388-7_13

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

Nayara Ortiz, J., Ricardo de Araujo, R., Aranha, D. F., Rodrigues Costa, S. I. & Dahab, R. (2021). The Ring-LWE Problem in Lattice-based Cryptography: The Case of Twisted Embeddings. Entropy, 23(9), Article 1108. https://doi.org/10.3390/e23091108

Napoli, O., Martins do Rosario, V., Aranha, D. F. & Borin, E. (2020). Evaluation and Mitigation of Timing Side-channel Leakages on Multiple-target Dynamic Binary Translators. In C. Bianchini, C. Osthoff, P. Souza & R. Ferreira (Eds.), High Performance Computing Systems: WSCAD 2018 (pp. 152-167). Springer. https://doi.org/10.1007/978-3-030-41050-6_10

Munch-Hansen, A., Orlandi, C. & Yakoubov, S. (2021). Stronger Notions and a More Efficient Construction of Threshold Ring Signatures. In P. Longa & C. Ràfols (Eds.), Progress in Cryptology – LATINCRYPT 2021 : 7th International Conference on Cryptology and Information Security in Latin America, Proceedings (pp. 363-381). Springer. https://doi.org/10.1007/978-3-030-88238-9_18

Miltersen, P. B., Nielsen, J. B. & Triandopoulos, N. (2009). Privacy-Enhancing Auctions Using Rational Cryptography. Lecture Notes in Computer Science, 5677, 541-558. https://doi.org/10.1007/978-3-642-03356-8_32

Displaying results 51 to 100 out of 617

2

Revised 02.06.2023

-

Marianne Dammand Iversen