E-mail     :    Arpita DOT Patra AT bristol DOT ac DOT uk, arpitapatra10 AT gmail DOT com
Address  :    Department of Computer Science
                    University of Bristol  
                    Merchant Venturers Building, Woodland Road
                    Bristol, BS8 1UB, United Kingdom

Brief Biography | Research & Publications | Curriculum Vitae | Professional Activities | Teaching Assistant | Photography | Others

Brief Biography

Research Interests

• Publications:
  
  Journal Publications:
  • On the Tradeoff Between Network Connectivity, Round Complexity and Communication Complexity of Reliable Message Transmission. Journal of ACM, 2012.
    with Ashwinkumar Badanidiyuru, Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  • Secure Message Transmission in Asynchronous Networks. Journal of Parallel and Distributed Computing, vol. 71, no. 8, pp. 1067-1074, 2011.
    with Ashish Choudhury, Ashwinkumar B. V, Kannan Srinathan and C. Pandu Rangan
  • Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality. International Journal of Applied Cryptography (IJACT), vol 2, Issue 2, pp. 159-197, 2010.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  • Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary. International Journal of Applied Cryptography (IJACT), vol. 1, Issue 3, pp. 200-224, 2009.
    with Ashish Choudhury, Kannan Srinathan, C. Pandu Rangan and Prasad Raghavendra
  
  Selected Conference Publications:
  • Brief Announcement: Efficient Optimally Resilient Statistical AVSS and Its Applications. Accepted in PODC 2012.
    with Ashish Choudhury
  • Computational Verifiable Secret Sharing Revisited. ASIACRYPT 2011,LNCS 7073, pp. 590-609, 2011.
    with Michael Backes and Aniket Kate
  • Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity. OPODIS 2011,LNCS 7109, pp. 34-49, 2011.
  • Simple and Efficient Single Round Almost Perfectly Secure Message Transmission Tolerating Generalized Adversary. ACNS 2011, LNCS 6715, pp. 292-308, 2011.
    with Ashish Choudhury and Kaoru Kurosawa
  • The Round Complexity of Verifiable Secret Sharing: The Statistical Case. ASIACRYPT 2010, LNCS 6477, pp. 431-447, 2010.
    with Ranjit Kumaresan and C. Pandu Rangan
  • Communication Efficient Asynchronous Byzantine Agreement. PODC 2010, pp 243-244, ACM Press, 2010.
    with C. Pandu Rangan
  • On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks. ICDCN 2010, LNCS 5935, pp. 42--53, 2010.
    with Ashish Choudhury and C. Pandu Rangan
  • Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience. AFRICACRYPT 2010, LNCS 6055, pp. 184--202, 2010.
    with Ashish Choudhury and C. Pandu Rangan
  • The Round Complexity of Verifiable Secret Sharing Revisited. CRYPTO 2009, LNCS 5677, pp. 487--504, 2009.
    with Ashish Choudhury, Tal Rabin and C. Pandu Rangan
  • Simple and Efficient Asynchronous Byzantine Agreement with Optimal Resilience. PODC 2009, pp. 92--101, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  • Information Theoretically Secure Multi Party Set Intersection Re-Visited. SAC 2009, LNCS 5867, pp. 71--91, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  • Perfectly Secure Message Transmission in Directed Networks Revisited. PODC 2009, pp. 278--279, ACM Press, 2009.
    with Ashish Choudhury and C. Pandu Rangan
  • On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks. ICDCN 2009, LNCS 5408, pp. 148--162, 2009.
    with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
  • On Tradeoff Between Network Connectivity, Phase Complexity and Communication Complexity of Reliable Communication Tolerating Mixed Adversary. PODC 2008, pp. 115--124, ACM Press, 2008
    with Ashish Choudhury, Ashwinkumar B.V, Kannan Srinathan and C. Pandu Rangan
  • Brief Announcement: Efficient Single Phase Unconditionally Secure Message Transmission with Optimum Communication Complexity. PODC 2008, pp. 457, ACM Press, 2008.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  • Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary. ACISP 2008, LNCS 5107, pp. 170--186, 2008.
    with Ashish Choudhury, Madhu Gayatri and C. Pandu Rangan
  • Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited. SCN 2008, LNCS 5229, pp. 309--326, 2008.
    with Ashish Choudhury and C. Pandu Rangan
  • Constant Phase Efficient Protocols for Perfectly Secure Message Transmission in Directed Networks. PODC 2007, pp. 322-323, ACM Press, 2007.
    with Ashish Choudhury and C. Pandu Rangan
  • Perfectly Secure Message Transmission in Directed Networks Tolerating Mixed Adversary. DISC 2007, LNCS 4731, pp. 496--498, 2007.
    with Ashish Choudhury, Kannan Srinathan and C. Pandu Rangan
  
  All publications:
  • See Publications.


• PhD Thesis: PhD Thesis on Multiparty Computation, Byzantine Agreement, Verifiable Secret Sharing and Reliable and Secure Message Transmission.


• Master Thesis: Master Thesis on Efficient Methods for Face Recognition and Multi-modal Biometry.

Professional Activities

Program committee member for the following conferences:

• Indocrypt 2012
• SPACE 2012

Reviewer for the following conferences and journals: CRYPTO 2012, TCC 2012, Crypto 2011, Journal of Cryptology, TCC 2011, INDOCRYPT 2010, ASIACRYPT 2010, PKC 2010, IEEE Transactions on Dependable and Secure Computing, ICITS 2009, ICALP 2009, ACISP 2008, ICITS 2008, ASIACRYPT 2008, CANS 2008.

Teaching Assistantship (2011-2012)

Teaching Assistant for the following courses at ETH Zurich:

• Cryptographic Protocols Spring 2012
• Discrete Mathematics Fall 2011

Photography