Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArpita Patra
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2023
[j21]Ashish Choudhury, Arpita Patra:
On the Communication Efficiency of Statistically Secure Asynchronous MPC with Optimal Resilience. J. Cryptol. 36(2): 13 (2023)- [j20]Nishat Koti
, Shravani Mahesh Patil, Arpita Patra, Ajith Suresh:
MPClan: Protocol Suite for Privacy-Conscious Computations. J. Cryptol. 36(3): 22 (2023) - [j19]Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
Find Thy Neighbourhood: Privacy-Preserving Local Clustering. Proc. Priv. Enhancing Technol. 2023(2): 23-39 (2023) - [j18]Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal:
Ruffle: Rapid 3-Party Shuffle Protocols. Proc. Priv. Enhancing Technol. 2023(3): 24-42 (2023) - [c80]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. EUROCRYPT (2) 2023: 251-281 - [c79]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. STOC 2023: 1527-1536 - [c78]Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
Shield: Secure Allegation Escrow System with Stronger Guarantees. WWW 2023: 2252-2262 - [i87]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. Electron. Colloquium Comput. Complex. TR23 (2023) - [i86]Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
Shield: Secure Allegation Escrow System with Stronger Guarantees. IACR Cryptol. ePrint Arch. 2023: 338 (2023) - [i85]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Statistical MPC with Optimal Resiliency. IACR Cryptol. ePrint Arch. 2023: 418 (2023) - [i84]Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal:
Ruffle: Rapid 3-party shuffle protocols. IACR Cryptol. ePrint Arch. 2023: 431 (2023) - [i83]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Detect, Pack and Batch: Perfectly-Secure MPC with Linear Communication and Constant Expected Time. IACR Cryptol. ePrint Arch. 2023: 557 (2023) - [i82]Banashri Karmakar, Nishat Koti, Arpita Patra, Sikhar Patranabis, Protik Paul, Divya Ravi:
sfAsterisk: Super-fast MPC with a Friend. IACR Cryptol. ePrint Arch. 2023: 1098 (2023) - [i81]Ittai Abraham, Gilad Asharov, Arpita Patra, Gilad Stern:
Perfectly Secure Asynchronous Agreement on a Core Set in Constant Expected Time. IACR Cryptol. ePrint Arch. 2023: 1130 (2023) - 2022
- [j17]Anirudh Chandramouli, Ashish Choudhury, Arpita Patra:
A Survey on Perfectly Secure Verifiable Secret-sharing. ACM Comput. Surv. 54(11s): 232:1-232:36 (2022) - [j16]Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy:
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. Proc. Priv. Enhancing Technol. 2022(2): 517-556 (2022) - [c77]Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul:
Attaining GOD Beyond Honest Majority with Friends and Foes. ASIACRYPT (1) 2022: 556-587 - [c76]Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
PentaGOD: Stepping beyond Traditional GOD with Five Parties. CCS 2022: 1843-1856 - [c75]Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal:
Poster: Vogue: Faster Computation of Private Heavy Hitters. CCS 2022: 3371-3373 - [c74]Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh:
Poster MPClan: : Protocol Suite for Privacy-Conscious Computations. CCS 2022: 3379-3381 - [c73]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Verifiable Relation Sharing and Multi-verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority - (Extended Abstract). CRYPTO (4) 2022: 33-56 - [c72]Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra:
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. CRYPTO (4) 2022: 453-482 - [c71]Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh:
Tetrad: Actively Secure 4PC for Secure Training and Inference. NDSS 2022 - [c70]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-Optimal Honest-Majority MPC in Minicrypt and with Everlasting Security - (Extended Abstract). TCC (2) 2022: 103-120 - [c69]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. TCC (1) 2022: 384-414 - [c68]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. TCC (2) 2022: 470-501 - [c67]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. TCC (2) 2022: 532-561 - [e2]Alastair R. Beresford, Arpita Patra, Emanuele Bellini:
Cryptology and Network Security - 21st International Conference, CANS 2022, Dubai, United Arab Emirates, November 13-16, 2022, Proceedings. Lecture Notes in Computer Science 13641, Springer 2022, ISBN 978-3-031-20973-4 [contents] - [i80]Gokulnath Pillai, Eikansh Gupta, Ajith Suresh, Vinod Ganapathy, Arpita Patra:
Privadome: Protecting Citizen Privacy from Delivery Drones. CoRR abs/2205.04961 (2022) - [i79]Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh:
MPClan: Protocol Suite for Privacy-Conscious Computations. CoRR abs/2206.12224 (2022) - [i78]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Verifiable Relation Sharing and Multi-Verifier Zero-Knowledge in Two Rounds: Trading NIZKs with Honest Majority. IACR Cryptol. ePrint Arch. 2022: 167 (2022) - [i77]Nishat Koti, Shravani Patil, Arpita Patra, Ajith Suresh:
MPClan: Protocol Suite for Privacy-Conscious Computations. IACR Cryptol. ePrint Arch. 2022: 675 (2022) - [i76]Benny Applebaum, Yuval Ishai, Or Karni, Arpita Patra:
Quadratic Multiparty Randomized Encodings Beyond Honest Majority and Their Applications. IACR Cryptol. ePrint Arch. 2022: 813 (2022) - [i75]Ashish Choudhury, Arpita Patra:
On the Communication Efficiency of Statistically-Secure Asynchronous MPC with Optimal Resilience. IACR Cryptol. ePrint Arch. 2022: 913 (2022) - [i74]Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
PentaGOD: Stepping beyond Traditional GOD with Five Parties. IACR Cryptol. ePrint Arch. 2022: 1118 (2022) - [i73]Aditya Hegde, Nishat Koti, Varsha Bhat Kukkala, Shravani Patil, Arpita Patra, Protik Paul:
Attaining GOD Beyond Honest Majority With Friends and Foes. IACR Cryptol. ePrint Arch. 2022: 1207 (2022) - [i72]Yuval Ishai, Arpita Patra, Sikhar Patranabis, Divya Ravi, Akshayaram Srinivasan:
Fully-Secure MPC with Minimal Trust. IACR Cryptol. ePrint Arch. 2022: 1248 (2022) - [i71]Ittai Abraham, Gilad Asharov, Shravani Patil, Arpita Patra:
Asymptotically Free Broadcast in Constant Expected Time via Packed VSS. IACR Cryptol. ePrint Arch. 2022: 1266 (2022) - [i70]Bar Alon, Olga Nissenbaum, Eran Omri, Anat Paskin-Cherniavsky, Arpita Patra:
On Perfectly Secure Two-Party Computation for Symmetric Functionalities with Correlated Randomness. IACR Cryptol. ePrint Arch. 2022: 1504 (2022) - [i69]Pranav Jangir, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal, Somya Sangal:
Vogue: Faster Computation of Private Heavy Hitters. IACR Cryptol. ePrint Arch. 2022: 1561 (2022) - [i68]Pranav Shriram A, Nishat Koti, Varsha Bhat Kukkala, Arpita Patra, Bhavish Raj Gopal:
Find Thy Neighbourhood: Privacy-Preserving Local Clustering. IACR Cryptol. ePrint Arch. 2022: 1727 (2022) - 2021
- [j15]Chaya Ganesh, Arpita Patra:
Optimal extension protocols for byzantine broadcast and agreement. Distributed Comput. 34(1): 59-77 (2021) - [j14]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. J. Cryptol. 34(4): 40 (2021) - [c66]Arpita Patra, Akshayaram Srinivasan:
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. CRYPTO (2) 2021: 185-213 - [c65]Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame:
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. HOST 2021: 147-157 - [c64]Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame:
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. USENIX Security Symposium 2021: 2165-2182 - [c63]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. USENIX Security Symposium 2021: 2651-2668 - [i67]Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh:
Tetrad: Actively Secure 4PC for Secure Training and Inference. CoRR abs/2106.02850 (2021) - [i66]Anirudh C, Ashish Choudhury, Arpita Patra:
A Survey on Perfectly-Secure Verifiable Secret-Sharing. CoRR abs/2112.11393 (2021) - [i65]Benny Applebaum, Eliran Kachlon, Arpita Patra:
Round-optimal Honest-majority MPC in Minicrypt and with Everlasting Security. IACR Cryptol. ePrint Arch. 2021: 346 (2021) - [i64]Anirudh C, Ashish Choudhury, Arpita Patra:
A Survey on Perfectly-Secure Verifiable Secret-Sharing. IACR Cryptol. ePrint Arch. 2021: 445 (2021) - [i63]Nishat Koti, Arpita Patra, Rahul Rachuri, Ajith Suresh:
Tetrad: Actively Secure 4PC for Secure Training and Inference. IACR Cryptol. ePrint Arch. 2021: 755 (2021) - [i62]Arpita Patra, Akshayaram Srinivasan:
Three-Round Secure Multiparty Computation from Black-Box Two-Round Oblivious Transfer. IACR Cryptol. ePrint Arch. 2021: 957 (2021) - [i61]Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame:
SynCirc: Efficient Synthesis of Depth-Optimized Circuits for Secure Computation. IACR Cryptol. ePrint Arch. 2021: 1153 (2021) - [i60]Pankaj Dayama, Arpita Patra, Protik Paul, Nitin Singh, Dhinakaran Vinayagamurthy:
How to prove any NP statement jointly? Efficient Distributed-prover Zero-Knowledge Protocols. IACR Cryptol. ePrint Arch. 2021: 1599 (2021) - 2020
- [j13]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
The Power of Shunning: Efficient Asynchronous Byzantine Agreement Revisited. J. ACM 67(3): 14:1-14:59 (2020) - [j12]Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh:
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. Proc. Priv. Enhancing Technol. 2020(2): 459-480 (2020) - [c62]Arpita Patra, Divya Ravi, Swati Singla:
On the Exact Round Complexity of Best-of-Both-Worlds Multi-party Computation. ASIACRYPT (3) 2020: 60-91 - [c61]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. FOCS 2020: 1277-1284 - [c60]Arpita Patra, Ajith Suresh:
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. NDSS 2020 - [c59]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors (Extended Abstract). TCC (2) 2020: 562-594 - [i59]Arpita Patra, Ajith Suresh:
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. CoRR abs/2005.09042 (2020) - [i58]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. CoRR abs/2005.10296 (2020) - [i57]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. Electron. Colloquium Comput. Complex. TR20 (2020) - [i56]Arpita Patra, Ajith Suresh:
BLAZE: Blazing Fast Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2020: 42 (2020) - [i55]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Round Complexity of Perfect MPC with Active Security and Optimal Resiliency. IACR Cryptol. ePrint Arch. 2020: 581 (2020) - [i54]Nishat Koti, Mahak Pancholi, Arpita Patra, Ajith Suresh:
SWIFT: Super-fast and Robust Privacy-Preserving Machine Learning. IACR Cryptol. ePrint Arch. 2020: 592 (2020) - [i53]Arpita Patra, Divya Ravi, Swati Singla:
On the Exact Round Complexity of Best-of-both-Worlds Multi-party Computation. IACR Cryptol. ePrint Arch. 2020: 1050 (2020) - [i52]Arpita Patra, Thomas Schneider, Ajith Suresh, Hossein Yalame:
ABY2.0: Improved Mixed-Protocol Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2020: 1225 (2020) - [i51]Benny Applebaum, Eliran Kachlon, Arpita Patra:
The Resiliency of MPC with Low Interaction: The Benefit of Making Errors. IACR Cryptol. ePrint Arch. 2020: 1419 (2020)
2010 – 2019
- 2019
- [c58]Arpita Patra, Divya Ravi:
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. ASIACRYPT (1) 2019: 456-487 - [c57]Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh:
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CCSW@CCS 2019: 81-92 - [c56]Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla:
Fast Actively Secure Five-Party Computation with Security Beyond Abort. CCS 2019: 1573-1590 - [i50]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. CoRR abs/1911.08834 (2019) - [i49]Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh:
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. CoRR abs/1912.02592 (2019) - [i48]Harsh Chaudhari, Ashish Choudhury, Arpita Patra, Ajith Suresh:
ASTRA: High Throughput 3PC over Rings with Application to Secure Prediction. IACR Cryptol. ePrint Arch. 2019: 429 (2019) - [i47]Megha Byali, Carmit Hazay, Arpita Patra, Swati Singla:
Fast Actively Secure Five-Party Computation with Security Beyond Abort. IACR Cryptol. ePrint Arch. 2019: 863 (2019) - [i46]Arpita Patra, Divya Ravi:
Beyond Honest Majority: The Round Complexity of Fair and Robust Multi-party Computation. IACR Cryptol. ePrint Arch. 2019: 998 (2019) - [i45]Megha Byali, Harsh Chaudhari, Arpita Patra, Ajith Suresh:
FLASH: Fast and Robust Framework for Privacy-preserving Machine Learning. IACR Cryptol. ePrint Arch. 2019: 1365 (2019) - 2018
- [j11]Arpita Patra, Divya Ravi:
On the Power of Hybrid Networks in Multi-Party Computation. IEEE Trans. Inf. Theory 64(6): 4207-4227 (2018) - [c55]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. CCS 2018: 677-694 - [c54]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. CRYPTO (2) 2018: 425-458 - [c53]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-Knowledge from Garbled Circuits. Public Key Cryptography (2) 2018: 499-529 - [c52]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. PODC 2018: 295-304 - [c51]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-Tolerant Consensus in Directed Graph Revisited (Extended Abstract). SIROCCO 2018: 55-71 - [i44]Chaya Ganesh, Yashvanth Kondi, Arpita Patra, Pratik Sarkar:
Efficient Adaptively Secure Zero-knowledge from Garbled Circuits. IACR Cryptol. ePrint Arch. 2018: 43 (2018) - [i43]Laasya Bangalore, Ashish Choudhury, Arpita Patra:
Almost-Surely Terminating Asynchronous Byzantine Agreement Revisited. IACR Cryptol. ePrint Arch. 2018: 394 (2018) - [i42]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Crash-tolerant Consensus in Directed Graph Revisited. IACR Cryptol. ePrint Arch. 2018: 436 (2018) - [i41]Arpita Patra, Divya Ravi:
On the Exact Round Complexity of Secure Three-Party Computation. IACR Cryptol. ePrint Arch. 2018: 481 (2018) - [i40]Megha Byali, Arun Joseph, Arpita Patra, Divya Ravi:
Fast Secure Computation for Small Population over the Internet. IACR Cryptol. ePrint Arch. 2018: 710 (2018) - 2017
- [j10]Carmit Hazay, Arpita Patra:
Efficient One-Sided Adaptively Secure Computation. J. Cryptol. 30(1): 321-371 (2017) - [j9]Ashish Choudhury, Arpita Patra:
An Efficient Framework for Unconditionally Secure Multiparty Computation. IEEE Trans. Inf. Theory 63(1): 428-468 (2017) - [c50]Yashvanth Kondi, Arpita Patra:
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. CRYPTO (1) 2017: 188-222 - [c49]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-Secure MPC with t t n / 3 in Partially Synchronous Network. ICITS 2017: 83-109 - [c48]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. NDSS 2017 - [c47]Ashish Choudhury, Gayathri Garimella, Arpita Patra, Divya Ravi, Pratik Sarkar:
Brief Announcement: Crash-Tolerant Consensus in Directed Graph Revisited. DISC 2017: 46:1-46:4 - [e1]Arpita Patra, Nigel P. Smart:
Progress in Cryptology - INDOCRYPT 2017 - 18th International Conference on Cryptology in India, Chennai, India, December 10-13, 2017, Proceedings. Lecture Notes in Computer Science 10698, Springer 2017, ISBN 978-3-319-71666-4 [contents] - [i39]Chaya Ganesh, Arpita Patra:
Optimal Extension Protocols for Byzantine Broadcast and Agreement. IACR Cryptol. ePrint Arch. 2017: 63 (2017) - [i38]Yashvanth Kondi, Arpita Patra:
Privacy-Free Garbled Circuits for Formulas: Size Zero and Information-Theoretic. IACR Cryptol. ePrint Arch. 2017: 561 (2017) - [i37]Ashish Choudhury, Arpita Patra, Divya Ravi:
Round and Communication Efficient Unconditionally-secure MPC with t < n/3 in Partially Synchronous Network. IACR Cryptol. ePrint Arch. 2017: 1006 (2017) - [i36]Megha Byali, Arpita Patra, Divya Ravi, Pratik Sarkar:
Fast and Universally-Composable Oblivious Transfer and Commitment Scheme with Adaptive Security. IACR Cryptol. ePrint Arch. 2017: 1165 (2017) - 2016
- [c46]Chaya Ganesh, Arpita Patra:
Broadcast Extensions with Optimal Communication and Round Complexity. PODC 2016: 371-380 - [c45]Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Optimally-Resilient Robust MPC Using Preprocessing. SCN 2016: 147-168 - [i35]Arpita Patra, Pratik Sarkar, Ajith Suresh:
Fast Actively Secure OT Extension for Short Secrets. IACR Cryptol. ePrint Arch. 2016: 940 (2016) - 2015
- [j8]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation. J. Cryptol. 28(1): 49-109 (2015) - [c44]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. ASIACRYPT (1) 2015: 443-469 - [c43]Ashish Choudhury, Arpita Patra:
Optimally Resilient Asynchronous MPC with Linear Communication Complexity. ICDCN 2015: 5:1-5:10 - [c42]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. PODC 2015: 291-300 - [i34]Carmit Hazay, Yehuda Lindell, Arpita Patra:
Adaptively Secure Computation with Partial Erasures. IACR Cryptol. ePrint Arch. 2015: 450 (2015) - [i33]Ashish Choudhury, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Linear Overhead Robust MPC with Honest Majority Using Preprocessing. IACR Cryptol. ePrint Arch. 2015: 705 (2015) - [i32]Carmit Hazay, Arpita Patra, Bogdan Warinschi:
Selective Opening Security for Receivers. IACR Cryptol. ePrint Arch. 2015: 860 (2015) - 2014
- [j7]Arpita Patra, Ashish Choudhury, C. Pandu Rangan:
Asynchronous Byzantine Agreement with optimal resilience. Distributed Comput. 27(2): 111-146 (2014) - [c41]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. LATINCRYPT 2014: 219-236 - [c40]Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of MPC over a Large Population. SCN 2014: 197-217 - [c39]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. SCN 2014: 476-493 - [c38]Carmit Hazay, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. TCC 2014: 368-393 - [i31]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Anonymous Authentication with Shared Secrets. IACR Cryptol. ePrint Arch. 2014: 73 (2014) - [i30]Ashish Choudhury, Arpita Patra, Nigel P. Smart:
Reducing the Overhead of Cloud MPC. IACR Cryptol. ePrint Arch. 2014: 105 (2014) - [i29]Joël Alwen, Martin Hirt, Ueli Maurer, Arpita Patra, Pavel Raykov:
Key-Indistinguishable Message Authentication Codes. IACR Cryptol. ePrint Arch. 2014: 107 (2014) - 2013
- [c37]Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating between MPC and FHE. ASIACRYPT (2) 2013: 221-240 - [c36]Ashish Choudhury, Martin Hirt, Arpita Patra:
Asynchronous Multiparty Computation with Linear Communication Complexity. DISC 2013: 388-402 - [i28]Ashish Choudhury, Jake Loftus, Emmanuela Orsini, Arpita Patra, Nigel P. Smart:
Between a Rock and a Hard Place: Interpolating Between MPC and FHE. IACR Cryptol. ePrint Arch. 2013: 85 (2013) - [i27]Carmit Hazay, Arpita Patra:
One-Sided Adaptively Secure Two-Party Computation. IACR Cryptol. ePrint Arch. 2013: 593 (2013) - 2012
- [j6]Ashwinkumar Badanidiyuru, Arpita Patra, Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan:
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission. J. ACM 59(5): 22:1-22:35 (2012) - [c35]Ashish Choudhury, Arpita Patra:
Brief announcement: efficient optimally resilient statistical AVSS and its applications. PODC 2012: 103-104 - [i26]Ashish Choudhury, Martin Hirt, Arpita Patra:
Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity. IACR Cryptol. ePrint Arch. 2012: 517 (2012) - 2011
- [j5]