Samuel Ranellucci

According to our database1, Samuel Ranellucci authored at least 34 papers between 2011 and 2019.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2019
Two-party Private Set Intersection with an Untrusted Third Party.
Proceedings of the 2019 ACM SIGSAC Conference on Computer and Communications Security, 2019

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

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
IACR Cryptology ePrint Archive, 2018

Secure Computation with Low Communication from Cross-checking.
IACR Cryptology ePrint Archive, 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.
Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Secure Computation with Low Communication from Cross-Checking.
Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 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 Cryptology ePrint Archive, 2017

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

Resource-efficient OT combiners with active security.
IACR Cryptology ePrint Archive, 2017

Resource-Efficient OT Combiners with Active Security.
Proceedings of the Theory of Cryptography - 15th International Conference, 2017

On the Computational Overhead of MPC with Dishonest Majority.
Proceedings of the Public-Key Cryptography - PKC 2017, 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, CCS 2017, Dallas, TX, USA, October 30, 2017

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.
Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, CCS 2017, Dallas, TX, USA, October 30, 2017

2016
On the Computational Overhead of MPC with Dishonest Majority.
IACR Cryptology ePrint Archive, 2016

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

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2015

Security of Linear Secret-Sharing Schemes against Mass Surveillance.
IACR Cryptology ePrint Archive, 2015

Generalizing Efficient Multiparty Computation.
IACR Cryptology ePrint Archive, 2015

Generalizing Efficient Multiparty Computation.
Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Security of Linear Secret-Sharing Schemes Against Mass Surveillance.
Proceedings of the Cryptology and Network Security - 14th International Conference, 2015

2014
Efficient Generic Zero-Knowledge Proofs from Commitments.
IACR Cryptology ePrint Archive, 2014

Server-Aided Two-Party Computation with Simultaneous Corruption.
IACR Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 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 Cryptology ePrint Archive, 2011

On the Efficiency of Bit Commitment Reductions.
Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011


  Loading...