Samuel Ranellucci

Publication Activity (10 Years)

Years Active: 2011-2022
Publications (10 Years): 25

Top Topics

Trusted Third Party

Secure Multiparty Computation

Privacy Preserving

Top Venues

IACR Cryptol. ePrint Arch.

Publications

Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
Highly Efficient OT-Based Multiplication Protocols. EUROCRYPT (1) (2022)
Iftach Haitner, Nikolaos Makriyannis, Samuel Ranellucci, Eliad Tsfadia
Highly Efficient OT-Based Multiplication Protocols. IACR Cryptol. ePrint Arch. 2021 (2021)
Sahar Mazloom, Phi Hung Le, Samuel Ranellucci, S. Dov Gordon
Secure parallel computation on national scale volumes of data. USENIX Security Symposium (2020)
Phi Hung Le, Samuel Ranellucci, S. Dov Gordon
Two-party Private Set Intersection with an Untrusted Third Party. CCS (2019)
Phi Hung Le, Samuel Ranellucci, S. Dov Gordon
Two-party Private Set Intersection with an Untrusted Third Party. IACR Cryptol. ePrint Arch. 2019 (2019)
Yehuda Lindell, Ariel Nof, Samuel Ranellucci
Fast Secure Multiparty ECDSA with Practical Distributed Key Generation and Applications to Cryptocurrency Custody. IACR Cryptol. ePrint Arch. 2018 (2018)
Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2018 (2018)
S. Dov Gordon, Samuel Ranellucci, Xiao Wang
Secure Computation with Low Communication from Cross-Checking. ASIACRYPT (3) (2018)
S. Dov Gordon, Samuel Ranellucci, Xiao Wang
Secure Computation with Low Communication from Cross-checking. IACR Cryptol. ePrint Arch. 2018 (2018)
Daniel Genkin, S. Dov Gordon, Samuel Ranellucci
Best of Both Worlds in Secure Computation, with Low Communication Overhead. ACNS (2018)
Jonathan Katz, Samuel Ranellucci, Mike Rosulek, Xiao Wang
Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. CRYPTO (3) (2018)
Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. CRYPTO (1) (2017)
Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci
Resource-efficient OT combiners with active security. IACR Cryptol. ePrint Arch. 2017 (2017)
Xiao Wang, Samuel Ranellucci, Jonathan Katz
Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. CCS (2017)
Jesper Buus Nielsen, Samuel Ranellucci
On the Computational Overhead of MPC with Dishonest Majority. Public Key Cryptography (2) (2017)
Ignacio Cascudo, Ivan Damgård, Oriol Farràs, Samuel Ranellucci
Resource-Efficient OT Combiners with Active Security. TCC (2) (2017)
Jonathan Katz, Samuel Ranellucci, Xiao Wang
Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2017 (2017)
Jonathan Katz, Samuel Ranellucci, Xiao Wang
Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation. IACR Cryptol. ePrint Arch. 2017 (2017)
Xiao Wang, Samuel Ranellucci, Jonathan Katz
Global-Scale Secure Multiparty Computation. CCS (2017)
Jesper Buus Nielsen, Samuel Ranellucci
Reactive Garbling: Foundation, Instantiation, Application. ASIACRYPT (2) (2016)
Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci
Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. TCC (B1) (2016)
Ivan Damgård, Jesper Buus Nielsen, Michael Nielsen, Samuel Ranellucci
Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. IACR Cryptol. ePrint Arch. 2016 (2016)
Jesper Buus Nielsen, Samuel Ranellucci
On the Computational Overhead of MPC with Dishonest Majority. IACR Cryptol. ePrint Arch. 2016 (2016)
Ignacio Cascudo, Ivan Damgård, Felipe Lacerda, Samuel Ranellucci
Oblivious Transfer from Any Non-Trivial Elastic Noisy Channels via Secret Key Agreement. IACR Cryptol. ePrint Arch. 2016 (2016)
Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias
Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract). ICITS (2016)
Bernardo David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp
Generalizing Efficient Multiparty Computation. IACR Cryptol. ePrint Arch. 2015 (2015)
Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci
Security of Linear Secret-Sharing Schemes Against Mass Surveillance. CANS (2015)
Bernardo Machado David, Ryo Nishimaki, Samuel Ranellucci, Alain Tapp
Generalizing Efficient Multiparty Computation. ICITS (2015)
Irene Giacomelli, Ruxandra F. Olimid, Samuel Ranellucci
Security of Linear Secret-Sharing Schemes against Mass Surveillance. IACR Cryptol. ePrint Arch. 2015 (2015)
Jesper Buus Nielsen, Samuel Ranellucci
Foundations of Reactive Garbling Schemes. IACR Cryptol. ePrint Arch. 2015 (2015)
Samuel Ranellucci, Alain Tapp, Rasmus Winther Zakarias
Efficient Generic Zero-Knowledge Proofs from Commitments. IACR Cryptol. ePrint Arch. 2014 (2014)
Sébastien Gambs, Samuel Ranellucci, Alain Tapp
The Crypto-Democracy and the Trustworthy (Position Paper). DPM/SETOP/QASA (2014)
Ignacio Cascudo, Ivan Damgård, Samuel Ranellucci
Server-Aided Two-Party Computation with Simultaneous Corruption. IACR Cryptol. ePrint Arch. 2014 (2014)
Sébastien Gambs, Samuel Ranellucci, Alain Tapp
The Crypto-democracy and the Trustworthy. CoRR (2014)
Samuel Ranellucci, Alain Tapp
Secure Two-Party Computation via Leaky Generalized Oblivious Transfer. IACR Cryptol. ePrint Arch. 2013 (2013)
Anne Broadbent, Stacey Jeffery, Samuel Ranellucci, Alain Tapp
Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority. ICITS (2012)
Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger
On the Efficiency of Bit Commitment Reductions. ASIACRYPT (2011)
Samuel Ranellucci, Alain Tapp, Severin Winkler, Jürg Wullschleger
On the Efficiency of Bit Commitment Reductions. IACR Cryptol. ePrint Arch. 2011 (2011)