Aarhus Crypto Seminar



The Aarhus crypto group has a weekly seminar where group members and visitors give talks. I organized the seminar in 2019 and 2020, and below you can find a list of all the talks during this time.

Talks 2020

Week Date Speaker Title
39 24/9 Divya Ravi On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation
38 17/9 Adam Blatchley Hansen Constant Time Analysis of NIST Lightweight Crypto Candidates
37 10/9 Jesper Buus Nielsen You Only Speak Once
36 3/9 Matteo Campanelli Decentralizing Authenticated Data Structures
35 24/8 Felix Engelmann Multi-Token Privacy Preserving Transactions
29-34 - Summer break
28 8-9/7 Crypto Summer Days
27 29/6 Daniel Escudero Information-Theoretically Secure MPC against Mixed Dynamic Adversaries
26 22/6 Carsten Baum A Framework for Universally Composable Publicly Verifiable Cryptographic Protocols
25 15/6 Muhammad Ishaq Efficient MPC via Program Analysis: A Framework for Efficient Optimal Mixing
24 8/6 Mark Simkin Better Property-Preserving Hash Functions
22-23 - TPMPC
21 18/5 Ivan Damgård Lower Bounds on Ad Hoc Threshold Encryption
20 - Eurocrypt
19 4/5 Benjamin Lipp Hybrid Public Key Encryption: Mechanized Provable Security of a New IRTF Standard
18 27/4 Mathias Hall-Andersen IOPs and DEEP-FRI
17 20/4 Eduardo Soria Vazquez Reducing the overhead of using Galois Rings in MPC
15-16 - Easter break
14 30/3 Joakim Brorsson Publicly Accountable Anonymity Revocation
13 23/3 Daniel Feher How private is a privacy-based blockchain? A study on Zcash
12 16/3 Alix Trieu How programming language research can help securely implement cryptography
11 9/3 Ivan Oleynikov Privacy-Preserving Proximity Testing with a Napping Party
10 2/3 Divya Ravi Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation
9 24/2 Rahul Rachuri Trident: Efficient 4PC Framework for Privacy Preserving Machine Learning
8 17/2 Daniel Escudero On the Communication Complexity of Single-Round Information-Theoretic Multiplication Protocols
7 13/2 Ida Tucker Distributing the elliptic curve digital signature algorithm both securely and efficiently
6 6/2 Cecilia Boschini Designing Privacy-Preserving Signatures from NIZK with Relaxed Extractability
5 30/1 Carsten Baum Fairness in the Eyes of the Data: Certifying Machine-Learning Models
4 23/1 Jesper Buus Nielsen (In)feasibility of Coin-Flip
3 16/1 Nikolaj Ignatieff Schwartzbach Communication Lower Bounds for Perfect Maliciously Secure MPC
1-2 - Holiday break

Talks 2019

Week Date Speaker Title
51-52 - Holiday break
12/12 Maciej Obremski Extractor Lower Bounds, Revisited.
50 9/12 Daniel Masny Two-Round Oblivious Transfer from CDH or LPN
49 5/12 Eduardo Soria Vazquez Shrinking Multi-Party Garbled Circuits
48 28/11 Sameer Wagh The Rise of Privacy Enhancing Technologies
21/11 Abdullah Talayhan Misuse Attacks on Post-quantum Cryptosystems
47 20/11 Tjerand Silde Electronic voting using lattice-based commitments and verifiable encryption
46 14/11 Nikolaj Ignatieff Schwartzbach How to sell Bananas using Blockchain: Composable Escrow Protocols for Non-Digital Goods and Services
45 7/11 Elena Pagnin The Simplest Multi-key Linearly Homomorphic Signature Scheme
44 31/10 Akira Takahashi Security of Hedged Fiat-Shamir Signatures under Fault Attacks
24/10 Luisa Siniscalchi Publicly Verifiable Zero Knowledge from Blockchains
43 22/10 Serge Fehr Adaptive reporgrammability of the quantum random oracle model
42 17/10 Mads Schaarup Andersen, Laura Lynggaard Nielsen Putting MPC to work in the health sector
41 -
40 3/10 Mark Simkin Optimal Oblivious Priority Queues
39 - Eurocrypt deadline
38 19/9 Suvradip Chakraborty Unique Witness Maps and Deterministic Leakage and Tamper Resilient Signatures
37 -
36 5/9 Anders Dalskov Securing DNSSEC Keys via Threshold ECDSA From Generic MPC
28-35 - Summer break
32 8/8 Mehdi Tibouchi Physical attacks on lattice-based signatures: breaking postquantum schemes on your classical laptop
29 19/7 Daniel Noble Private Set Intersection with Linear Communication from General Assumptions
27 4/7 Crypto summer day Program
26 27/6 Nikolaj Ignatieff Schwartzbach On combination locks
25 - TPMPC
24 13/6 Sabine Oechsner Exploring State-Separating Proofs for Multi-Party Computation
23 6/6 Akira Takahashi Degenerate fault attacks on elliptic curve parameters in OpenSSL
22 - Ascension Day
21 - Eurocrypt
Daniel Escudero New Primitives for Actively-Secure MPC over Rings with Applications to Private Machine Learning
20 16/5 Pierre Meyer Information-Theoretic Topology-Hiding Computation, revisited
19 9/5 Mark Abspoel MPC over rings
18 2/5 Daniele Friolo A Black-Box Construction of Fully-Simulatable, Round-Optimal Oblivious Transfer from Strongly Uniform Key Agreement
26/4 Eduardo Soria Vazquez Scaling Multi-Party Computation: High Latency Networks and Many Parties
17 25/4 Sophia Yakoubov Turning HATE Into LOVE: Homomorphic Ad Hoc Threshold Encryption for Scalable MPC
16 - Easter
15 11/4 Diego Aranha Introducing arithmetic failures to accelerate QC-MDPC code-based cryptography
4/4 Elena Pagnin SAID: Reshaping Signal into an Identity-Based Asynchronous Messaging Protocol with Authenticated Ratcheting
14 1/4 Carsten Baum Insured MPC: Efficient Secure Computation with Financial Penalties
13 - PhD defence
12 21/3 Daniel Tschudi Unknot the knot unless its not the unknot. Or a knot which is not the unknot.
14/3 Vassilis Zikas Composable analysis of blockchains and applications
11 11/3 Carsten Baum Using TopGear in Overdrive: A more efficient ZKPoK for SPDZ
10 7/3 Anders Dalskov Secure Evaluation of Quantized Neural Networks
9 28/2 Nico Döttling
8 - BIU Winter School
7 14/2 Ivan Damgård A Communication Lower Bound for Statistically Secure MPC with Preprocessing
6 7/2 Michael Nielsen Circuit Randomization Revisited