Advances in quantum cryptography

S Pirandola, UL Andersen, L Banchi… - Advances in optics …, 2020 - opg.optica.org
Quantum cryptography is arguably the fastest growing area in quantum information science.
Novel theoretical protocols are designed on a regular basis, security proofs are constantly …

Secure multi-party computation with identifiable abort

Y Ishai, R Ostrovsky, V Zikas - … in Cryptology–CRYPTO 2014: 34th Annual …, 2014 - Springer
Protocols for secure multi-party computation (MPC) that resist a dishonest majority are
susceptible to “denial of service” attacks, allowing even a single malicious party to force the …

Proactive obfuscation

T Roeder, FB Schneider - ACM Transactions on Computer Systems …, 2010 - dl.acm.org
Proactive obfuscation is a new method for creating server replicas that are likely to have
fewer shared vulnerabilities. It uses semantics-preserving code transformations to generate …

Practical quantum multiparty signatures using quantum-key-distribution networks

EO Kiktenko, AS Zelenetsky, AK Fedorov - Physical Review A, 2022 - APS
Digital signatures are widely used for providing security of communications. At the same
time, the security of currently deployed digital signature protocols is based on unproven …

Round-preserving parallel composition of probabilistic-termination cryptographic protocols

R Cohen, S Coretti, J Garay, V Zikas - Journal of Cryptology, 2021 - Springer
An important benchmark for multi-party computation protocols (MPC) is their round
complexity. For several important MPC tasks, such as broadcast,(tight) lower bounds on the …

Unconditionally secure signature schemes revisited

CM Swanson, DR Stinson - International Conference on Information …, 2011 - Springer
Unconditionally secure signature (USS) schemes provide the ability to electronically sign
documents without the reliance on computational assumptions needed in traditional digital …

Must the communication graph of MPC protocols be an expander?

E Boyle, R Cohen, D Data, P Hubáček - Journal of Cryptology, 2023 - Springer
Secure multiparty computation (MPC) on incomplete communication networks has been
studied within two primary models:(1) where a partial network is fixed a priori, and thus …

Efficient unconditionally secure signatures using universal hashing

R Amiri, A Abidin, P Wallden, E Andersson - Applied Cryptography and …, 2018 - Springer
Digital signatures are one of the most important cryptographic primitives. In this work we
construct an information-theoretically secure signature scheme which, unlike prior schemes …

Unconditionally secure anonymous encryption and group authentication

G Hanaoka, J Shikata, Y Hanaoka… - The Computer …, 2006 - academic.oup.com
Anonymous channels or similar techniques that achieve sender's anonymity play important
roles in many applications, eg electronic voting. However, they will be meaningless if …

Unconditionally secure chaffing-and-winnowing: a relationship between encryption and authentication

G Hanaoka, Y Hanaoka, M Hagiwara… - … Algorithms and Error …, 2006 - Springer
A chaffing-and-winnowing is a cryptographic scheme which does not require encryption but
instead use a message authentication code (MAC) to provide the same function as …