Samuel Ranellucci

According to our database1, Samuel Ranellucci authored at least 29 papers between 2011 and 2021.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2021
Highly Efficient OT-Based Multiplication Protocols.
IACR Cryptol. ePrint Arch., 2021

2020
Secure parallel computation on national scale volumes of data.
Proceedings of the 29th USENIX Security Symposium, 2020

2019
Two-party Private Set Intersection with an Untrusted Third Party.
IACR Cryptol. ePrint Arch., 2019

2018
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody.
IACR Cryptol. ePrint Arch., 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2018

Secure Computation with Low Communication from Cross-checking.
IACR Cryptol. ePrint Arch., 2018

Best of Both Worlds in Secure Computation, with Low Communication Overhead.
Proceedings of the Applied Cryptography and Network Security, 2018

2017
Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation.
IACR Cryptol. ePrint Arch., 2017

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.
IACR Cryptol. ePrint Arch., 2017

Resource-efficient OT combiners with active security.
IACR Cryptol. ePrint Arch., 2017

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.
Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Global-Scale Secure Multiparty Computation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016
On the Computational Overhead of MPC with Dishonest Majority.
IACR Cryptol. ePrint Arch., 2016

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.
IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.
IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement.
Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract).
Proceedings of the Information Theoretic Security - 9th International Conference, 2016

Reactive Garbling: Foundation, Instantiation, Application.
Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015
Foundations of Reactive Garbling Schemes.
IACR Cryptol. ePrint Arch., 2015

Security of Linear Secret-Sharing Schemes against Mass Surveillance.
IACR Cryptol. ePrint Arch., 2015

Generalizing Efficient Multiparty Computation.
IACR Cryptol. ePrint Arch., 2015

2014
Efficient Generic Zero-Knowledge Proofs from Commitments.
IACR Cryptol. ePrint Arch., 2014

Server-Aided Two-Party Computation with Simultaneous Corruption.
IACR Cryptol. ePrint Arch., 2014

The Crypto-democracy and the Trustworthy.
CoRR, 2014

The Crypto-Democracy and the Trustworthy (Position Paper).
Proceedings of the Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance, 2014

2013
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.
IACR Cryptol. ePrint Arch., 2013

2012
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority.
Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011
On the Efficiency of Bit Commitment Reductions.
IACR Cryptol. ePrint Arch., 2011


  Loading...