Sandro Coretti

According to our database1, Sandro Coretti authored at least 24 papers between 2013 and 2022.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
The Generals’ Scuttlebutt: Byzantine-Resilient Gossip Protocols.
IACR Cryptol. ePrint Arch., 2022

On Seedless PRNGs and Premature Next.
IACR Cryptol. ePrint Arch., 2022

The Generals' Scuttlebutt: Byzantine-Resilient Gossip Protocols.
Proceedings of the 2022 ACM SIGSAC Conference on Computer and Communications Security, 2022

2021
Round-Preserving Parallel Composition of Probabilistic-Termination Cryptographic Protocols.
J. Cryptol., 2021

Modular Design of Secure Group Messaging Protocols and the Security of MLS.
IACR Cryptol. ePrint Arch., 2021

Fast Isomorphic State Channels.
Proceedings of the Financial Cryptography and Data Security, 2021

2020
Non-malleable Encryption: Simpler, Shorter, Stronger.
J. Cryptol., 2020

Hydra: Fast Isomorphic State Channels.
IACR Cryptol. ePrint Arch., 2020

Continuous Group Key Agreement with Active Security.
IACR Cryptol. ePrint Arch., 2020

2019
Probabilistic Termination and Composability of Cryptographic Protocols.
J. Cryptol., 2019

Rate-Optimizing Compilers for Continuously Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2019

Seedless Fruit is the Sweetest: Random Number Generation, Revisited.
IACR Cryptol. ePrint Arch., 2019

Security Analysis and Improvements for the IETF MLS Standard for Group Messaging.
IACR Cryptol. ePrint Arch., 2019

2018
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models.
IACR Cryptol. ePrint Arch., 2018

The Double Ratchet: Security Notions, Proofs, and Modularization for the Signal Protocol.
IACR Cryptol. ePrint Arch., 2018

2017
Random Oracles and Non-Uniformity.
IACR Cryptol. ePrint Arch., 2017

Efficiency lower bounds for commit-and-prove constructions.
Proceedings of the 2017 IEEE International Symposium on Information Theory, 2017

2016
Constant-Round Asynchronous Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2016

Constant-Round Asynchronous Multi-Party Computation Based on One-Way Functions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Non-Malleable Encryption: Simpler, Shorter, Stronger.
IACR Cryptol. ePrint Arch., 2015

2014
From Single-Bit to Multi-Bit Public-Key Encryption via Non-Malleable Codes.
IACR Cryptol. ePrint Arch., 2014

2013
Key Exchange with Unilateral Authentication: Composable Security Definition and Modular Protocol Design.
IACR Cryptol. ePrint Arch., 2013

Constructing Confidential Channels from Authenticated Channels - Public-Key Encryption Revisited.
IACR Cryptol. ePrint Arch., 2013

A Constructive Perspective on Key Encapsulation.
Proceedings of the Number Theory and Cryptography, 2013


  Loading...