On the Efficiency of Bit Commitment Reductions. - Samuel Ranellucci; Alain Tapp; Severin Winkler; Jürg Wullschleger (IACR Cryptol. ePrint Arch., 2011)

Trading Robustness for Correctness and Privacy in Certain Multiparty Computations, beyond an Honest Majority. - Anne Broadbent; Stacey Jeffery; Samuel Ranellucci; Alain Tapp (ICITS, 2012)

Secure Two-Party Computation via Leaky Generalized Oblivious Transfer. - Samuel Ranellucci; Alain Tapp (IACR Cryptol. ePrint Arch., 2013)

The Crypto-Democracy and the Trustworthy (Position Paper). - Sébastien Gambs; Samuel Ranellucci; Alain Tapp (DPM/SETOP/QASA, 2014)

The Crypto-democracy and the Trustworthy. - Sébastien Gambs; Samuel Ranellucci; Alain Tapp (CoRR, 2014)

Server-Aided Two-Party Computation with Simultaneous Corruption. - Ignacio Cascudo; Ivan Damgård; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2014)

Efficient Generic Zero-Knowledge Proofs from Commitments. - Samuel Ranellucci; Alain Tapp; Rasmus Winther Zakarias (IACR Cryptol. ePrint Arch., 2014)

Generalizing Efficient Multiparty Computation. - Bernardo David; Ryo Nishimaki; Samuel Ranellucci; Alain Tapp (IACR Cryptol. ePrint Arch., 2015)

Security of Linear Secret-Sharing Schemes against Mass Surveillance. - Irene Giacomelli; Ruxandra F. Olimid; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2015)

Foundations of Reactive Garbling Schemes. - Jesper Buus Nielsen; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2015)

Reactive Garbling: Foundation, Instantiation, Application. - Jesper Buus Nielsen; Samuel Ranellucci (ASIACRYPT (2), 2016)

Efficient Generic Zero-Knowledge Proofs from Commitments (Extended Abstract). - Samuel Ranellucci; Alain Tapp; Rasmus Winther Zakarias (ICITS, 2016)

Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement. - Ignacio Cascudo; Ivan Damgård; Felipe Lacerda; Samuel Ranellucci (TCC (B1), 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)

Gate-scrambling Revisited - or: The TinyTable protocol for 2-Party Secure Computation. - Ivan Damgård; Jesper Buus Nielsen; Michael Nielsen 001; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2016)

On the Computational Overhead of MPC with Dishonest Majority. - Jesper Buus Nielsen; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2016)

Authenticated Garbling and Efficient Maliciously Secure Two-Party Computation. - Xiao Wang 012; Samuel Ranellucci; Jonathan Katz (CCS, 2017)

Global-Scale Secure Multiparty Computation. - Xiao Wang 012; Samuel Ranellucci; Jonathan Katz (CCS, 2017)

The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited. - Ivan Damgård; Jesper Buus Nielsen; Michael Nielsen 001; Samuel Ranellucci (CRYPTO (1), 2017)

Resource-efficient OT combiners with active security. - Ignacio Cascudo; Ivan Damgård; Oriol Farràs; Samuel Ranellucci (IACR Cryptol. ePrint Arch., 2017)

Authenticated Garbling and Communication-Efficient, Constant-Round, Secure Two-Party Computation. - Jonathan Katz; Samuel Ranellucci; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2017)

Authenticated Garbling and Efficient Maliciously Secure Multi-Party Computation. - Jonathan Katz; Samuel Ranellucci; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2017)

Best of Both Worlds in Secure Computation, with Low Communication Overhead. - Daniel Genkin; S. Dov Gordon; Samuel Ranellucci (ACNS, 2018)

Secure Computation with Low Communication from Cross-checking. - S. Dov Gordon; Samuel Ranellucci; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 2018)

Optimizing Authenticated Garbling for Faster Secure Two-Party Computation. - Jonathan Katz; Samuel Ranellucci; Mike Rosulek; Xiao Wang 012 (IACR Cryptol. ePrint Arch., 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)

Two-party Private Set Intersection with an Untrusted Third Party. - Phi Hung Le; Samuel Ranellucci; S. Dov Gordon (IACR Cryptol. ePrint Arch., 2019)

Secure parallel computation on national scale volumes of data. - Sahar Mazloom; Phi Hung Le; Samuel Ranellucci; S. Dov Gordon (USENIX Security Symposium, 2020)

Highly Efficient OT-Based Multiplication Protocols. - Iftach Haitner; Nikolaos Makriyannis; Samuel Ranellucci; Eliad Tsfadia (IACR Cryptol. ePrint Arch., 2021)