Edit Profile Ranellucci, Samuel Compute Distance To: Compute Author ID: ranellucci.samuel Published as: Ranellucci, Samuel Documents Indexed: 12 Publications since 2011 all top 5 Co-Authors 0 single-authored 4 Tapp, Alain 3 Damgård, Ivan Bjerre 3 Nielsen, Jesper Buus 2 Cascudo, Ignacio 2 Gordon, S. Dov 2 Wang, Xiao 1 Broadbent, Anne 1 David, Bernardo Machado 1 Farràs, Oriol 1 Genkin, Daniel 1 Jeffery, Stacey 1 Katz, Jonathan N. 1 Lacerda, Felipe G. 1 Nielsen, Michael Teit 1 Nishimaki, Ryo 1 Rosulek, Mike 1 Winkler, Severin 1 Wullschleger, Jürg 1 Zakarias, Rasmus Serials Fields 12 Information and communication theory, circuits (94-XX) 2 Computer science (68-XX) Publications by Year Citations contained in zbMATH 5 Publications have been cited 9 times in 8 Documents Cited by ▼ Year ▼ The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited. Zbl 1407.94099Damgård, Ivan; Nielsen, Jesper Buus; Nielsen, Michael; Ranellucci, Samuel 3 2017 Generalizing efficient multiparty computation. Zbl 1336.94042David, Bernardo M.; Nishimaki, Ryo; Ranellucci, Samuel; Tapp, Alain 2 2015 On the efficiency of bit commitment reductions. Zbl 1227.94062Ranellucci, Samuel; Tapp, Alain; Winkler, Severin; Wullschleger, Jürg 2 2011 Optimizing authenticated garbling for faster secure two-party computation. Zbl 07216153Katz, Jonathan; Ranellucci, Samuel; Rosulek, Mike; Wang, Xiao 1 2018 Efficient generic zero-knowledge proofs from commitments (extended abstract). Zbl 1407.94148Ranellucci, Samuel; Tapp, Alain; Zakarias, Rasmus 1 2016 Optimizing authenticated garbling for faster secure two-party computation. Zbl 07216153Katz, Jonathan; Ranellucci, Samuel; Rosulek, Mike; Wang, Xiao 1 2018 The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited. Zbl 1407.94099Damgård, Ivan; Nielsen, Jesper Buus; Nielsen, Michael; Ranellucci, Samuel 3 2017 Efficient generic zero-knowledge proofs from commitments (extended abstract). Zbl 1407.94148Ranellucci, Samuel; Tapp, Alain; Zakarias, Rasmus 1 2016 Generalizing efficient multiparty computation. Zbl 1336.94042David, Bernardo M.; Nishimaki, Ryo; Ranellucci, Samuel; Tapp, Alain 2 2015 On the efficiency of bit commitment reductions. Zbl 1227.94062Ranellucci, Samuel; Tapp, Alain; Winkler, Severin; Wullschleger, Jürg 2 2011 all top 5 Cited by 24 Authors 2 Peters, Thomas J. 2 Ruano, Diego 1 Cascudo, Ignacio 1 Couteau, Geoffroy 1 García-Marco, Ignacio 1 Garg, Sanjam 1 Gundersen, Jaron Skovsted 1 Hazay, Carmit 1 Ishai, Yuval 1 Katz, Jonathan N. 1 Kushilevitz, Eyal 1 Libert, Benoît 1 Malozemoff, Alex J. 1 Márquez-Corbella, Irene 1 Ostrovsky, Rafail 1 Pointcheval, David 1 Qian, Chen 1 Ranellucci, Samuel 1 Sahai, Amit 1 Scholl, Peter 1 Soria-Vazquez, Eduardo 1 Tapp, Alain 1 Wang, Xiao 1 Zakarias, Rasmus Cited in 3 Serials 1 Journal of Cryptology 1 Designs, Codes and Cryptography 1 Finite Fields and their Applications Cited in 2 Fields 8 Information and communication theory, circuits (94-XX) 1 Number theory (11-XX) Citations by Year