3 papers
quant-ph2025
Protocols for Quantum Weak Coin Flipping
Atul Singh Arora, Jérémie Roland, Chrysoula Vlachou +1
Weak coin flipping is an important cryptographic primitive$\unicode{x2013}$it is the strongest known secure two-party computation primitive that classically becomes secure only und…
cs.CR2025
Universally Composable Commitments with Communicating Malicious Physically Uncloneable Functions
Lourenço Abecasis, Paulo Mateus, Chrysoula Vlachou
In this work, we explore the possibility of universally composable (UC)-secure commitments using Physically Uncloneable Functions (PUFs) within a new adversarial model. We introduc…
quant-ph2024
Quantum Universally Composable Oblivious Linear Evaluation
Manuel B. Santos, Paulo Mateus, Chrysoula Vlachou
Oblivious linear evaluation is a generalization of oblivious transfer, whereby two distrustful parties obliviously compute a linear function, f (x) = ax + b, i.e., each one provide…