×

zbMATH — the first resource for mathematics

Ranellucci, Samuel

Compute Distance To:
Author ID: ranellucci.samuel Recent zbMATH articles by "Ranellucci, Samuel"
Published as: Ranellucci, Samuel
Documents Indexed: 12 Publications since 2011

Serials

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.94099
Damgård, Ivan; Nielsen, Jesper Buus; Nielsen, Michael; Ranellucci, Samuel
3
2017
Generalizing efficient multiparty computation. Zbl 1336.94042
David, Bernardo M.; Nishimaki, Ryo; Ranellucci, Samuel; Tapp, Alain
2
2015
On the efficiency of bit commitment reductions. Zbl 1227.94062
Ranellucci, Samuel; Tapp, Alain; Winkler, Severin; Wullschleger, Jürg
2
2011
Optimizing authenticated garbling for faster secure two-party computation. Zbl 07216153
Katz, Jonathan; Ranellucci, Samuel; Rosulek, Mike; Wang, Xiao
1
2018
Efficient generic zero-knowledge proofs from commitments (extended abstract). Zbl 1407.94148
Ranellucci, Samuel; Tapp, Alain; Zakarias, Rasmus
1
2016
Optimizing authenticated garbling for faster secure two-party computation. Zbl 07216153
Katz, Jonathan; Ranellucci, Samuel; Rosulek, Mike; Wang, Xiao
1
2018
The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited. Zbl 1407.94099
Damgård, Ivan; Nielsen, Jesper Buus; Nielsen, Michael; Ranellucci, Samuel
3
2017
Efficient generic zero-knowledge proofs from commitments (extended abstract). Zbl 1407.94148
Ranellucci, Samuel; Tapp, Alain; Zakarias, Rasmus
1
2016
Generalizing efficient multiparty computation. Zbl 1336.94042
David, Bernardo M.; Nishimaki, Ryo; Ranellucci, Samuel; Tapp, Alain
2
2015
On the efficiency of bit commitment reductions. Zbl 1227.94062
Ranellucci, Samuel; Tapp, Alain; Winkler, Severin; Wullschleger, Jürg
2
2011

Citations by Year