Arpita Patra

Nigel P. Smart

IACR Cryptol. ePrint Arch., 2014

Asynchronous Byzantine Agreement with optimal resilience.

[BibT_eX]

[DOI]

Distributed Comput., 2014

One-Sided Adaptively Secure Two-Party Computation.

[BibT_eX]

[DOI]

Carmit Hazay

Proceedings of the Theory of Cryptography - 11th Theory of Cryptography Conference, 2014

Reducing the Overhead of MPC over a Large Population.

[BibT_eX]

[DOI]

Nigel P. Smart

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Key-Indistinguishable Message Authentication Codes.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks - 9th International Conference, 2014

Anonymous Authentication with Shared Secrets.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology - LATINCRYPT 2014, 2014

2013

Asynchronous Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Martin Hirt

Proceedings of the Distributed Computing - 27th International Symposium, 2013

Between a Rock and a Hard Place: Interpolating between MPC and FHE.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology - ASIACRYPT 2013, 2013

2012

On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission.

[BibT_eX]

[DOI]

Ashwinkumar Badanidiyuru

J. ACM, 2012

Unconditionally Secure Asynchronous Multiparty Computation with Linear Communication Complexity.

[BibT_eX]

[DOI]

Martin Hirt

IACR Cryptol. ePrint Arch., 2012

Brief announcement: efficient optimally resilient statistical AVSS and its applications.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2012

2011

Secure message transmission in asynchronous networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2011

Statistical Asynchronous Weak Commitment Scheme: A New Primitive to Design Statistical Asynchronous Verifiable Secret Sharing Scheme.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2011

Error-free Multi-valued Broadcast and Byzantine Agreement with Optimal Communication Complexity.

[BibT_eX]

[DOI]

Proceedings of the Principles of Distributed Systems - 15th International Conference, 2011

Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

The Round Complexity of Perfectly Secure General VSS.

[BibT_eX]

[DOI]

Kaoru Kurosawa

Proceedings of the Information Theoretic Security - 5th International Conference, 2011

On the Communication Complexity of Reliable and Secure Message Transmission in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - ICISC 2011 - 14th International Conference, Seoul, Korea, November 30, 2011

Computational Verifiable Secret Sharing Revisited.

[BibT_eX]

[DOI]

Michael Backes

Aniket Kate

Proceedings of the Advances in Cryptology - ASIACRYPT 2011, 2011

Simple and Efficient Single Round almost Perfectly Secure Message Transmission Tolerating Generalized Adversary.

[BibT_eX]

[DOI]

Kaoru Kurosawa

Proceedings of the Applied Cryptography and Network Security, 2011

2010

Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality.

[BibT_eX]

[DOI]

Int. J. Appl. Cryptogr., 2010

Studies on Verifiable Secret Sharing, Byzantine Agreement and Multiparty Computation.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2010

The Round Complexity of General VSS.

[BibT_eX]

[DOI]

Kaoru Kurosawa

IACR Cryptol. ePrint Arch., 2010

Communication and Round Efficient Information Checking Protocol

[BibT_eX]

[DOI]

CoRR, 2010

Brief announcement: communication efficient asynchronous byzantine agreement.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Brief announcement: perfectly secure message transmissiontolerating mobile mixed adversary with reduced phase complexity.

[BibT_eX]

[DOI]

Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Communication Optimal Multi-valued Asynchronous Broadcast Protocol.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2010

On Communication Complexity of Secure Message Transmission in Directed Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

The Round Complexity of Verifiable Secret Sharing: The Statistical Case.

[BibT_eX]

[DOI]

Ranjit Kumaresan

Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2010

2009

Perfectly reliable and secure message transmission tolerating mobile adversary.

[BibT_eX]

[DOI]

Int. J. Appl. Cryptogr., 2009

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2009

Information Theoretically Secure Multi Party Set Intersection Re-visited.

[BibT_eX]

[DOI]

Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

Brief announcement: perfectly secure message transmission in directed networks re-visited.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Simple and efficient asynchronous byzantine agreement with optimal resilience.

[BibT_eX]

[DOI]

Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2009

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, 4th International Conference, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

The Round Complexity of Verifiable Secret Sharing Revisited.

[BibT_eX]

[DOI]

Proceedings of the Advances in Cryptology, 2009

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.

[BibT_eX]

[DOI]

Proceedings of the 2009 ACM Symposium on Information, 2009

Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

2008

Enhancing decision combination of face and fingerprint by exploitation of individual classifier space: An approach to multi-modal biometry.

[BibT_eX]

[DOI]

Sukhendu Das

Pattern Recognit., 2008

Unconditionally Secure Multiparty Set Intersection Re-Visited.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficient Asynchronous Multiparty Computation with Optimal Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficient Asynchronous Byzantine Agreement with Optimal Resilience.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Statistically Reliable and Secure Message Transmission in Directed Networks.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.

[BibT_eX]

[DOI]

IACR Cryptol. ePrint Arch., 2008

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.

[BibT_eX]

[DOI]

Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Efficient single phase unconditionally secure message transmission with optimum communication complexity.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary.

[BibT_eX]

[DOI]

Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

Round Efficient Unconditionally Secure Multiparty Computation Protocol.

[BibT_eX]

[DOI]

Proceedings of the Progress in Cryptology, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.

[BibT_eX]

[DOI]

Proceedings of the Information Theoretic Security, Third International Conference, 2008

Unconditionally Reliable Message Transmission in Directed Hypergraphs.

[BibT_eX]

[DOI]

Proceedings of the Cryptology and Network Security, 7th International Conference, 2008

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.

[BibT_eX]

[DOI]

Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007

Indoor versus Outdoor Scene Classification Using Probabilistic Neural Network.

[BibT_eX]

[DOI]

EURASIP J. Adv. Signal Process., 2007

Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.

[BibT_eX]

[DOI]

Proceedings of the Distributed Computing, 21st International Symposium, 2007

Constant phase efficient protocols for secure message transmission in directed networks.

[BibT_eX]

[DOI]