Arpita Patra

International Association for Cryptologic Research

Arpita Patra Search web for home page

Program Committees

1	2019	PKC	pc
2	2018	Eurocrypt	pc
3	2018	Asiacrypt	pc
4	2018	PKC	pc
5	2017	PKC	pc
6	2017	Asiacrypt	pc

Publications

	year	title	booktitle	pages
1	2018	On the Exact Round Complexity of Secure Three-Party Computation	crypto	425-458
2	2018	Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits	pkc	499-529
3	2017	Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic	crypto	188-222
4	2017	Efficient One-Sided Adaptively Secure Computation	jofc	321-371
5	2015	Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation	jofc	49-109
6	2015	Linear Overhead Robust MPC with Honest Majority Using Preprocessing	eprint	705
7	2015	Selective Opening Security for Receivers	eprint	860
8	2015	Adaptively Secure Computation with Partial Erasures	eprint	450
9	2015	Selective Opening Security for Receivers	asiacrypt	online
10	2014	One-Sided Adaptively Secure Two-Party Computation	tcc	online
11	2014	Key-Indistinguishable Message Authentication Codes	eprint	107
12	2014	Reducing the Overhead of Cloud MPC	eprint	105
13	2014	Anonymous Authentication with Shared Secrets	eprint	73
14	2013	Between a Rock and a Hard Place: Interpolating between MPC and FHE	asiacrypt	online
15	2011	Computational Verifiable Secret Sharing Revisited	asiacrypt	online
16	2010	The Round Complexity of Verifiable Secret Sharing: The Statistical Case	asiacrypt	online
17	2010	Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience	eprint	online
18	2010	Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation	eprint	online
19	2009	The Round Complexity of Verifiable Secret Sharing Revisited	crypto	online
20	2009	Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication	eprint	online
21	2008	Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary	eprint	online
22	2008	Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary	eprint	online
23	2008	Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality	eprint	online
24	2008	On Round Complexity of Unconditionally Secure VSS	eprint	online
25	2008	Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary	eprint	online
26	2008	Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited	eprint	online
27	2008	Unconditionally Reliable Message Transmission in Directed Hypergraphs	eprint	online
28	2008	Efficient Asynchronous Multiparty Computation with Optimal Resilience	eprint	online
29	2008	On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks	eprint	online
30	2008	Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary	eprint	online
31	2008	Unconditionally Secure Multiparty Set Intersection Re-Visited	eprint	online
32	2008	Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience	eprint	online

Arpita Patra Search web for home page

Program Committees

Publications

Coauthors of Arpita Patra