Obserwuj
Arpita Patra
Arpita Patra
Associate Professor, Dept. of Computer Science & Automation, Indian Institute of Science
Zweryfikowany adres z iisc.ac.in - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
{ABY2. 0}: Improved {Mixed-Protocol} secure {Two-Party} computation
A Patra, T Schneider, A Suresh, H Yalame
30th USENIX Security Symposium (USENIX Security 21), 2165-2182, 2021
2692021
BLAZE: blazing fast privacy-preserving machine learning
A Patra, A Suresh
NDSS 2020, 2020
2192020
FLASH: fast and robust framework for privacy-preserving machine learning
M Byali, H Chaudhari, A Patra, A Suresh
Proceedings on Privacy Enhancing Technologies,, 2020
1732020
Astra: High throughput 3pc over rings with application to secure prediction
H Chaudhari, A Choudhury, A Patra, A Suresh
Proceedings of the 2019 ACM SIGSAC Conference on Cloud Computing Security …, 2019
1592019
{SWIFT}: Super-fast and robust {Privacy-Preserving} machine learning
N Koti, M Pancholi, A Patra, A Suresh
30th USENIX Security Symposium (USENIX Security 21), 2651-2668, 2021
1512021
Computational verifiable secret sharing revisited
M Backes, A Kate, A Patra
Advances in Cryptology–ASIACRYPT 2011: 17th International Conference on the …, 2011
1092011
Tetrad: Actively secure 4pc for secure training and inference
N Koti, A Patra, R Rachuri, A Suresh
arXiv preprint arXiv:2106.02850, 2021
772021
An efficient framework for unconditionally secure multiparty computation
A Choudhury, A Patra
IEEE Transactions on Information Theory 63 (1), 428-468, 2016
702016
The round complexity of verifiable secret sharing revisited
A Patra, A Choudhary, T Rabin, CP Rangan
Advances in Cryptology-CRYPTO 2009: 29th Annual International Cryptology …, 2009
682009
Multi party distributed private matching, set disjointness and cardinality of set intersection with information theoretic security
G Sathya Narayanan, T Aishwarya, A Agrawal, A Patra, A Choudhary, ...
Cryptology and Network Security: 8th International Conference, CANS 2009 …, 2009
602009
Efficient asynchronous verifiable secret sharing and multiparty computation
A Patra, A Choudhury, C Pandu Rangan
Journal of Cryptology 28, 49-109, 2015
582015
Error-free multi-valued broadcast and Byzantine agreement with optimal communication complexity
A Patra
International Conference On Principles Of Distributed Systems, 34-49, 2011
552011
Between a rock and a hard place: Interpolating between MPC and FHE
A Choudhury, J Loftus, E Orsini, A Patra, NP Smart
International conference on the theory and application of cryptology and …, 2013
542013
The round complexity of verifiable secret sharing: The statistical case
R Kumaresan, A Patra, CP Rangan
International Conference on the Theory and Application of Cryptology and …, 2010
542010
On the exact round complexity of secure three-party computation
A Patra, D Ravi
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
532018
Asynchronous multiparty computation with linear communication complexity
A Choudhury, M Hirt, A Patra
International Symposium on Distributed Computing, 388-402, 2013
512013
Unconditionally reliable and secure message transmission in undirected synchronous networks: Possibility, feasibility and optimality
A Patra, A Choudhury, C Pandu Rangan, K Srinathan
International Journal of Applied Cryptography 2 (2), 159-197, 2010
512010
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
A Patra, A Choudhary, CP Rangan
International Conference on Information Theoretic Security, 74-92, 2009
492009
A survey on perfectly secure verifiable secret-sharing
A Chandramouli, A Choudhury, A Patra
ACM Computing Surveys (CSUR) 54 (11s), 1-36, 2022
482022
Simple and efficient asynchronous byzantine agreement with optimal resilience
A Patra, A Choudhary, C Pandu Rangan
Proceedings of the 28th ACM symposium on Principles of distributed computing …, 2009
462009
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20