Samuel Ranellucci

According to our database, Samuel Ranellucci authored at least 29 papers between 2011 and 2022.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of four.

2022

Highly Efficient OT-Based Multiplication Protocols.

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia

Proceedings of the Advances in Cryptology - EUROCRYPT 2022 - 41st Annual International Conference on the Theory and Applications of Cryptographic Techniques, Trondheim, Norway, May 30, 2022

2020

Secure parallel computation on national scale volumes of data.

Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, S. Dov Gordon

Proceedings of the 29th USENIX Security Symposium, 2020

2019

Two-party Private Set Intersection with an Untrusted Third Party.

Phi Hung Le, Samuel Ranellucci, S. Dov Gordon

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.

Yehuda Lindell, Ariel Nof, Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2018

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation.

Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang

Proceedings of the Advances in Cryptology - CRYPTO 2018, 2018

Secure Computation with Low Communication from Cross-Checking.

S. Dov Gordon, Samuel Ranellucci, Xiao Wang

Proceedings of the Advances in Cryptology - ASIACRYPT 2018, 2018

Best of Both Worlds in Secure Computation, with Low Communication Overhead.

Daniel Genkin, S. Dov Gordon, Samuel Ranellucci

Proceedings of the Applied Cryptography and Network Security, 2018

2017

Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation.

Jonathan Katz, Samuel Ranellucci, Xiao Wang

IACR Cryptol. ePrint Arch., 2017

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation.

Jonathan Katz, Samuel Ranellucci, Xiao Wang

IACR Cryptol. ePrint Arch., 2017

Resource-Efficient OT Combiners with Active Security.

Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci

Proceedings of the Theory of Cryptography - 15th International Conference, 2017

On the Computational Overhead of MPC with Dishonest Majority.

Jesper Buus Nielsen, Samuel Ranellucci

Proceedings of the Public-Key Cryptography - PKC 2017, 2017

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited.

Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci

Proceedings of the Advances in Cryptology - CRYPTO 2017, 2017

Global-Scale Secure Multiparty Computation.

Xiao Wang, Samuel Ranellucci, Jonathan Katz

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation.

Xiao Wang, Samuel Ranellucci, Jonathan Katz

Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security, 2017

2016

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation.

Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement.

Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2016

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement.

Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci

Proceedings of the Theory of Cryptography - 14th International Conference, 2016

Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract).

Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias

Proceedings of the Information Theoretic Security - 9th International Conference, 2016

Reactive Garbling: Foundation, Instantiation, Application.

Jesper Buus Nielsen, Samuel Ranellucci

Proceedings of the Advances in Cryptology - ASIACRYPT 2016, 2016

2015

Foundations of Reactive Garbling Schemes.

Jesper Buus Nielsen, Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2015

Generalizing Efficient Multiparty Computation.

Bernardo Machado David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp

Proceedings of the Information Theoretic Security - 8th International Conference, 2015

Security of Linear Secret-Sharing Schemes Against Mass Surveillance.

Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci

Proceedings of the Cryptology and Network Security - 14th International Conference, 2015

2014

Efficient Generic Zero-Knowledge Proofs from Commitments.

Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias

IACR Cryptol. ePrint Arch., 2014

Server-Aided Two-Party Computation with Simultaneous Corruption.

Ignacio Cascudo, Ivan Damgård, Samuel Ranellucci

IACR Cryptol. ePrint Arch., 2014

The Crypto-democracy and the Trustworthy.

Sébastien Gambs, Samuel Ranellucci, Alain Tapp

CoRR, 2014

The Crypto-Democracy and the Trustworthy (Position Paper).

Sébastien Gambs, Samuel Ranellucci, Alain Tapp

Proceedings of the Data Privacy Management, Autonomous Spontaneous Security, and Security Assurance, 2014

2013

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer.

Samuel Ranellucci, Alain Tapp

IACR Cryptol. ePrint Arch., 2013

2012

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority.

Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp

Proceedings of the Information Theoretic Security - 6th International Conference, 2012

2011

On the Efficiency of Bit Commitment Reductions.

Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011