Browsing Computer Science and Automation (CSA) by Advisor "Patra, Arpita"
Now showing items 1-6 of 6
-
Adaptively Secure Primitives in the Random Oracle Model
Adaptive security embodies one of the strongest notions of security that allows an adversary to corrupt parties at any point during protocol execution and gain access to its internal state. Since it models reallife situations ... -
Fast Actively Secure OT Extension for Short Secrets
(2018-05-25)Oblivious Transfer (OT) is one of the most fundamental cryptographic primitives with wide-spread application in general secure multi-party computation (MPC) as well as in a number of tailored and special-purpose problems ... -
Honest Majority and Beyond: Efficient Secure Computation over Small Population
Secure Multi-Party Computation for small population has witnessed notable practically-efficient works in the setting of both honest majority and dishonest majority. While honest majority provides the promise of stronger ... -
MPCLeague: Robust MPC Platform for Privacy-Preserving Machine Learning
In the modern era of computing, machine learning tools have demonstrated their potential in vital sectors, such as healthcare and finance, to derive proper inferences. The sensitive and confidential nature of the data in ... -
On the Round Complexity Landscape of Secure Multi-party Computation
In secure multi-party computation (MPC), n parties wish to jointly perform a computation on their private inputs in a secure way, so that no adversary corrupting a subset of the parties can learn more information than their ... -
Practically Efficient Secure Small Party Computation over the Internet
Secure Multi-party Computation (MPC) with small population has drawn focus specifically due to customization in techniques and resulting efficiency that the constructions can offer. Practically efficient constructions ...