Valerio Pastro's Home PageE-Mail: vpastro86 (at) gmail (dot) com
From September 2013, I will be working with Rosario Gennaro at CUNY as a postdoc. The following page is to be taken as a reference of my previous status as a PhD student, and is no longer updated.
I am a PhD student in the third (and final) year of my studies at the Department of Computer Science of Aarhus University, doing research in cryptography under the supervision of Ivan Damgaard (Aarhus University, Denmark) and Ronald Cramer (Leiden University / CWI Amsterdam, The Netherlands).
Research InterestsIn cryptography:
- Secret sharing schemes
- Verifiable computation
- Multiparty computation
- Lattice-based cryptography
- Homomorphic encryption
- Algebraic geometry (especially elliptic curves)
- Algebraic number theory
- Practical Covertly Secure MPC for Dishonest Majority - or: Breaking the SPDZ Limits Ivan Damgard and Marcel Keller and Enrique Larraia and Valerio Pastro and Peter Scholl and Nigel P. Smart ESORICS, 2013. Best paper award.
- Construction of Rational Elliptic Surfaces of Mordell-Weil Rank Four Valerio Pastro Commentarii Mathematici Universitatis Sancti Pauli vol 61, no 1, 2012.
- Multiparty Computation from Somewhat Homomorphic Encryption Ivan Damgaard and Valerio Pastro and Nigel P. Smart and Sarah Zakarias CRYPTO, 2012.
- On the Amortized Complexity of Zero Knowledge Protocols for Multiplicative Relations Ronald Cramer and Ivan Damgaard and Valerio Pastro ICITS, 2012.
- Zero Knowledge Protocols and Multiparty Computation (progress report).
- Construction of Rational Elliptic Surfaces of Mordell-Weil Rank Four (master thesis).
ActivitiesDuring the course of my studies I have been the main organiser of the following study groups:
- Security of Practical Protocols (Summer 2012).
- Crypto Studygroup on Lattices (Spring 2012).
- Crypto Studygroup on MPC and Leakage (Spring 2011).
TeachingIn Fall 2011 I gave a course on elliptic curves to the PhD students, PostDocs, and Professors in the cryptography and complexity research groups at Aarhus University. More information below:
- Elliptic Curves Minicourse (Fall 2011).
- Regularity and Automata (Spring 2012).
- Optimization (Spring 2012).
- Computability and Logic (Fall 2011).
- Regularity and Automata (Spring 2011).
- An example of proof by deception (which does not work, of course!).