Lecture notes in computer science

Black-Box Proof of Knowledge of Plaintext and Multiparty Computation with Low Communication Overhead

Steven Myers, Mona Sergi, Abhi A. Shelat

Published Jan 1, 2013• 3 citations

Related papers

Active Security in Multiparty Computation over Black-Box Groups

Yvo Desmedt, Josef Pieprzyk, Ron Steinfeld

Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer

Arpita Patra, Akshayaram Srinivasan

Round-Optimal Black-Box Multiparty Computation from Polynomial-Time Assumptions

Michele Ciampi, Rafail Ostrovsky, Luisa Siniscalchi +1 more

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications

Jonathan I. Katz

Efficient and Non-malleable Proofs of Plaintext Knowledge and Applications (Extended Abstract)

Jonathan I. Katz

Constant-Round Multiparty Computation Using a Black-Box Pseudorandom Generator

Ivan Damgård, Yuval Ishai