Manuscripts


  • Round-Optimal Secure Multi-Party Computation  
    Shai Halevi, Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
    ePrint [pdf]

Publications


  • Four Round Secure Computation without Setup 
    Zvika Brakerski, Shai Halevi, Antigoni Polychroniadou
    TCC 2017 [pdf]

  • Laconic Oblivious Transfer and its Applications 
    Chongwon Cho, Nico Döttling, Sanjam Garg, Divya Gupta, Peihan Miao and Antigoni Polychroniadou
    CRYPTO 2017 [pdf] [slides]

  • Constant-Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model 
    Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
    PKC 2017 [pdf] [slides]

  • Composable Security in the Tamper-Proof Model under Minimal Complexity 
    Carmit Hazay, Antigoni Polychroniadou, Muthuramakrishnan Venkitasubramaniam
    TCC 2016 [pdf] [slides]

  • On the Communication required for Unconditionally Secure Multiplication 
    Ivan Damgaard, Jesper Buus Nielsen, Antigoni Polychroniadou, Michael Raskin
    CRYPTO 2016 [pdf] [slides]

  • The Exact Round Complexity of Secure Computation 
    Sanjam Garg, Pratyay Mukherjee, Omkant Pandey, Antigoni Polychroniadou
    EUROCRYPT 2016 [pdf]
    [slides]

  • Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE) 
    Ivan Damgaard, Antigoni Polychroniadou, Vanishree Rao
    PKC 2016 [pdf]
    [slides]

  • Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits 
    Daniel Genkin, Yuval Ishai, Antigoni Polychroniadou
    CRYPTO 2015 [pdf]
    [slides]

  • Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation 
    Sanjam Garg and Antigoni Polychroniadou
    TCC 2015 [pdf]
    [slides]

  • Efficient Leakage Resilient Circuit Compilers 
    Marcin Andrychowicz, Ivan Damgaard, Stefan Dziembowski, Sebastian Faust, Antigoni Polychroniadou
    CT-RSA 2015 [pdf]
    [slides]

Postgraduate Research Publications:

  • A Coding-Theoretic Approach to Recovering Noisy RSA Keys 
    K.G. Paterson, A. Polychroniadou and D.L. Sibborn
    ASIACRYPT 2012 [pdf]
    [slides]

  • The concept of Compatibility between Identity-Based and Certificateless Encryption Schemes 
    A. Polychroniadou, K. Chalkias, G. Stephanides
    SECRYPT 2012

  • Improved NetArgus: A Suite of Wi-Fi Positioning & SNMP Monitor 
    Tryfon L. Theodorou, Antigoni Polychroniadou, George E. Violettas, Christos K. Georgiadis
    WINSYS 2012

  • A Compatible Implementation between Identity-Based and Certificateless Encryption Schemes 
    A. Polychroniadou, K. Chalkias, G. Stephanides
    WEBIST 2012

Here is my DBLP entry

Invited (non-Conference) Talks


  • Laconic Oblivious Transfer and its Applications  
    IBM Research T.J. Watson, New York, 2017.
    Athens Cryptography Day, 2017 (at National Technical University of Athens).
    Aarhus University Theory Seminar, 2016.
    Tsinghua-Cornell Workshop on security and Cryptography, 2016.

  • On the Communication required for Unconditionally Secure Multiplication  
    Rutgers/DIMACS Theory of Computing Seminar, 2017 (at Rutgers University).
    IvanFest, Symposium on the Work of Ivan Damgård in connection with his 60th birthday, 2016.
    Cryptography Reunion Workshop at the Simons Institute, 2016 (at Berkeley University).
    IBM Research T.J. Watson, New York, 2016.

  • The Exact Round Complexity of Secure Computation  
    DIMACS Workshop on Cryptography for the RAM Model of Computation, 2016 (at MIT).
    IBM Research T.J. Watson, New York, 2016.
    University of Maryland Theory Seminar, 2016.
    CryptoAction Symposium 2016, Budapest, 2016.

  • Composable Security in the Tamper Proof Model under Minimal Complexity  
    Theory and Practice of Multi-Party Computation Workshop, 2017 (at University of Bristol).
    New York Area Crypto Day, 2017.

  • Efficient Multi-Party Computation: from Passive to Active Security via Secure SIMD Circuits  
    Securing Computation Workshop at the Simons Instituite, 2015 (at Berkeley University).

  • Two-Round Adaptively Secure MPC from Indistinguishability Obfuscation  
    Athens Cryptography Day, 2015 (at National Technical University of Athens).
    COST Action workshop co-located with TCC 2015, 2015.

  • Adaptively Secure UC Constant Round Multi-Party Computation Protocols  
    Theory of Cryptography workshop, 2014 (at Tsinghua University).
    Technion University Theory Seminar, 2014.
    Greater Tel Aviv Cryptography Seminar,Tel Aviv University, 2014.

  • A Coding-Theoretic Approach to Recovering Noisy RSA Keys  
    IDC Herzliya Computer Science Seminar, 2014.
    Aarhus University Theory Seminar, 2012.

  • The Concept of Compatibility between Identity-Based and Certificateless Encryption Schemes  
    CrossFyre, female researchers workshop, 2011 (at TU Darmstadt).

PhD Thesis


On the Communication and Round Complexity of Secure Computation  [pdf] Supervisor: Ivan Damgård.

Master Thesis


New Directions In Recovering Noisy RSA Keys (An Information Theoretic Approach) Supervisor: Kenneth G. Paterson.

Bachelor Thesis


Compatibility between IBE-related Schemes Supervisor: George Stephanides.

Teaching Assistant


Security, Spring 2013
Concurrency, Fall 2013, Fall 2014
Algoritms and Data structures, Spring 2014


Program Committees


PKC 2018
SCN 2018

External Reviews
TCC 2017[4], CRYPTO 2017[7], EUROCRYPT 2017[4], ASIACRYPT 2017[2],PKC 2017[2], TCC 2016-B[4], ASIACRYPT 2016[2], CRYPTO 2016[3], EUROCRYPT 2016[5], PKC 2016[4],TCC 2016-A[2], Indocrypt 2016[2], CCS 2016, SCN 2016, ACNS 2016, ASIACRYPT 2015[3], CRYPTO 2015[2], TCC 2015[2], PKC 2015, ICALP 2014, ProvSec 2014, ASIACRYPT 2014, PETS 2013, Inscrypt 2013, Journal of Cryptology.



Activities


Study Group on 'Efficient Secure Computation' , Spring 2013