Samuel Ranellucci

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