Author of the publication

Adaptively Secure UC Constant Round Multi-Party Computation Protocols.

, , and . IACR Cryptology ePrint Archive, (2014)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

No persons found for author name Rao, Vanishree
add a person with the name Rao, Vanishree
 

Other publications of authors with the same name

On the (In)security of Fischlin's Paradigm., , , and . TCC, volume 7785 of Lecture Notes in Computer Science, page 202-221. Springer, (2013)Achieving Differential Privacy in Secure Multiparty Data Aggregation Protocols on Star Networks., , , , and . CODASPY, page 115-125. ACM, (2017)Standard Security Does Not Imply Indistinguishability Under Selective Opening., , and . IACR Cryptology ePrint Archive, (2015)On the (In)security of Fischlin's Paradigm., , , and . IACR Cryptology ePrint Archive, (2012)Statistical Concurrent Non-malleable Zero Knowledge., , , , and . TCC, volume 8349 of Lecture Notes in Computer Science, page 167-191. Springer, (2014)Adaptively Secure Multi-Party Computation from LWE (via Equivocal FHE)., , and . Public Key Cryptography (2), volume 9615 of Lecture Notes in Computer Science, page 208-233. Springer, (2016)Round Optimal Blind Signatures., , , , and . CRYPTO, volume 6841 of Lecture Notes in Computer Science, page 630-648. Springer, (2011)Revisiting Lower and Upper Bounds for Selective Decommitments., , , and . IACR Cryptology ePrint Archive, (2011)Correlated-Input Secure Hash Functions., , and . TCC, volume 6597 of Lecture Notes in Computer Science, page 182-200. Springer, (2011)Standard Security Does Not Imply Indistinguishability Under Selective Opening., , and . TCC (B2), volume 9986 of Lecture Notes in Computer Science, page 121-145. (2016)