70 citations · 115 across the 9 of their papers we have counts for
10 papers
On the Necessity of Pre-agreed Secrets for Thwarting Last-minute Coercion: Vulnerabilities and Lessons From the Loki E-voting Protocol
Jingxin Qiao, Myrto Arapinis, Thomas Zacharias
Coercion-resistance (CR) is a crucial security property in e-voting systems. It ensures that an attacker cannot compel a voter to vote in a specific way by using threats or rewards…
Universally Composable Simultaneous Broadcast against a Dishonest Majority and Applications
Myrto Arapinis, Ábel Kocsis, Nikolaos Lamprou +2
Simultaneous broadcast (SBC) protocols [Chor et al., FOCS 1985] constitute a special class of broadcast channels which have proved extremely useful in the design of various distrib…
Quantum Lock: A Provable Quantum Communication Advantage
Kaushik Chakraborty, Mina Doosti, Yao Ma +3
Physical unclonable functions(PUFs) provide a unique fingerprint to a physical entity by exploiting the inherent physical randomness. Gao et al. discussed the vulnerability of most…
QEnclave -- A practical solution for secure quantum cloud computing
Yao Ma, Elham Kashefi, Myrto Arapinis +2
We introduce a secure hardware device named a QEnclave that can secure the remote execution of quantum operations while only using classical controls. This device extends to quantu…
A Unified Framework For Quantum Unforgeability
Mina Doosti, Mahshid Delavar, Elham Kashefi +1
In this paper, we continue the line of work initiated by Boneh and Zhandry at CRYPTO 2013 and EUROCRYPT 2013 in which they formally define the notion of unforgeability against quan…
Quantum Physical Unclonable Functions: Possibilities and Impossibilities
Myrto Arapinis, Mahshid Delavar, Mina Doosti +1
A Physical Unclonable Function (PUF) is a device with unique behaviour that is hard to clone hence providing a secure fingerprint. A variety of PUF structures and PUF-based applica…
Definitions and Analysis of Quantum E-voting Protocols
Myrto Arapinis, Elham Kashefi, Nikolaos Lamprou +1
Recent advances indicate that quantum computers will soon be reality. Motivated by this ever more realistic threat for existing classical cryptographic protocols, researchers have…
Composing security protocols: from confidentiality to privacy
Myrto Arapinis, Vincent Cheval, Stéphanie Delaune
Security protocols are used in many of our daily-life applications, and our privacy largely depends on their design. Formal verification techniques have proved their usefulness to…
Dynamic Tags for Security Protocols
Myrto Arapinis, Stéphanie Delaune, Steve Kremer
The design and verification of cryptographic protocols is a notoriously difficult task, even in symbolic models which take an abstract view of cryptography. This is mainly due to t…
Formal Analysis of UMTS Privacy
Myrto Arapinis, Loretta Ilaria Mancini, Eike Ritter +1
The ubiquitous presence of mobile communication devices and the continuous development of mo- bile data applications, which results in high level of mobile devices' activity and ex…