C. Pandu Rangan

According to our database1, C. Pandu Rangan
  • authored at least 307 papers between 1983 and 2017.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2017
An Efficient Certificateless Proxy Re-Encryption Scheme without Pairing.
IACR Cryptology ePrint Archive, 2017

Leakage-Resilient Tweakable Encryption from One-Way Functions.
IACR Cryptology ePrint Archive, 2017

Efficient Compilers for After-the-Fact Leakage: from CPA to CCA-2 secure PKE to AKE.
IACR Cryptology ePrint Archive, 2017

New Approach to Practical Leakage-Resilient Public-Key Cryptography.
IACR Cryptology ePrint Archive, 2017

An Efficient Non-transferable Proxy Re-encryption Scheme.
Proceedings of the Applications and Techniques in Information Security, 2017

Efficiently Obfuscating Re-Encryption Program Under DDH Assumption.
Proceedings of the Applied Cryptography and Network Security, 2017

Efficient Compilers for After-the-Fact Leakage: From CPA to CCA-2 Secure PKE to AKE.
Proceedings of the Information Security and Privacy - 22nd Australasian Conference, 2017

2016
Stronger public key encryption system withstanding RAM scraper like attacks.
Security and Communication Networks, 2016

A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers.
JoWUA, 2016

Formalizing the Relationship Between Commitment and Basic Cryptographic Primitives.
J. Internet Serv. Inf. Secur., 2016

Lattice-based identity-based resplittable threshold public key encryption scheme.
Int. J. Comput. Math., 2016

A Pairing-Free, One Round Identity Based Authenticated Key Exchange Protocol Secure Against Memory-Scrapers.
IACR Cryptology ePrint Archive, 2016

Flaw in the Security Analysis of Leakage-resilient Authenticated Key Exchange Protocol from CT-RSA 2016 and Restoring the Security Proof.
IACR Cryptology ePrint Archive, 2016

2015
Lattice Based Mix Network for Location Privacy in Mobile System.
Mobile Information Systems, 2015

Efficient Asynchronous Verifiable Secret Sharing and Multiparty Computation.
J. Cryptology, 2015

Efficiently Obfuscating Re-Encryption Program under DDH Assumption.
IACR Cryptology ePrint Archive, 2015

An Efficient Multiple PKG Compatible Identity Based Key Agreement for Vehicular Networks.
IACR Cryptology ePrint Archive, 2015

Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2015

Efficient, Pairing-Free, One Round Attribute-Based Authenticated Key Exchange.
IACR Cryptology ePrint Archive, 2015

Constant Size Ring Signature Without Random Oracle.
IACR Cryptology ePrint Archive, 2015

An Identity Based Encryption Scheme Resilient to RAM Scraper Like Malware Attacks.
IACR Cryptology ePrint Archive, 2015

Practical IBE Secure under CBDH - Encrypting Without Pairing.
Proceedings of the SECRYPT 2015, 2015

Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction.
Proceedings of the Provable Security, 2015

Certificateless Proxy Re-Encryption Without Pairing: Revisited.
Proceedings of the 3rd International Workshop on Security in Cloud Computing, 2015

Constant Size Ring Signature Without Random Oracle.
Proceedings of the Information Security and Privacy - 20th Australasian Conference, 2015

2014
Guest Editorial: Special Issue on Cyber Security Protections and Applications.
J. Internet Serv. Inf. Secur., 2014

Lattice Based Universal Re-encryption for Mixnet.
J. Internet Serv. Inf. Secur., 2014

Certificateless Proxy Re-Encryption Without Pairing.
IACR Cryptology ePrint Archive, 2014

Asynchronous Byzantine Agreement with optimal resilience.
Distributed Computing, 2014

Lattice Based Identity Based Unidirectional Proxy Re-Encryption Scheme.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2014

Pairing-free Single Round Certificateless and Identity Based Authenticated Key Exchange Protocols.
Proceedings of the SECRYPT 2014, 2014

Cryptanalysis of Unidirectional Proxy Re-Encryption Scheme.
Proceedings of the Information and Communication Technology, 2014

Efficient Lattice HIBE in the Standard Model with Shorter Public Parameters.
Proceedings of the Information and Communication Technology, 2014

Certificateless and Identity based Authenticated Key Exchange Protocols.
Proceedings of the E-Business and Telecommunications - 11th International Joint Conference, 2014

2013
Lattice Based Efficient Threshold Public Key Encryption Scheme.
JoWUA, 2013

Lattice Based Identity Based Proxy Re-Encryption Scheme.
J. Internet Serv. Inf. Secur., 2013

Lattice Based Forward-Secure Identity Based Encryption Scheme with Shorter Ciphertext.
J. Internet Serv. Inf. Secur., 2013

Efficient Certificateless Online/Offline Signature with tight security.
J. Internet Serv. Inf. Secur., 2013

A Revocable Online-Offline Certificateless Signature Scheme without Pairing.
IACR Cryptology ePrint Archive, 2013

Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2013

Identity-Based Identification Schemes from ID-KEMs.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2013

Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round.
Proceedings of the Provable Security - 7th International Conference, 2013

Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model.
Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory.
Proceedings of the Information Security and Cryptology - ICISC 2013, 2013

2012
A Special Purpose Signature Scheme for Secure Computation of Traffic in a Distributed Network.
JoWUA, 2012

PKI Based Signcryption without Pairing: an Efficient Scheme with Tight Security Reduction.
JoWUA, 2012

Lattice Forward-Secure Identity Based Encryption Scheme.
J. Internet Serv. Inf. Secur., 2012

Efficient Certificateless Online/Offline Signature.
J. Internet Serv. Inf. Secur., 2012

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

Stronger Public Key Encryption Schemes Withstanding RAM Scraper Like Attacks.
IACR Cryptology ePrint Archive, 2012

Strongly Unforgeable Proxy Re-Signature Schemes in the Standard model.
IACR Cryptology ePrint Archive, 2012

ID Based Signcryption Scheme in Standard Model.
IACR Cryptology ePrint Archive, 2012

On the Security of Attribute Based Signature Schemes.
IACR Cryptology ePrint Archive, 2012

On Provably Secure Code-Based Signature and Signcryption Scheme.
IACR Cryptology ePrint Archive, 2012

Optimal Parameters for Efficient Two-Party Computation Protocols.
Proceedings of the Information Security Theory and Practice. Security, Privacy and Trust in Computing Systems and Ambient Intelligent Ecosystems, 2012

Adaptively Secure Efficient Lattice (H)IBE in Standard Model with Short Public Parameters.
Proceedings of the Security, Privacy, and Applied Cryptography Engineering, 2012

Identity based partial aggregate signature scheme without pairing.
Proceedings of the 2012 35th IEEE Sarnoff Symposium, Newark, NJ, USA, May 21-22, 2012, 2012

ID Based Signcryption Scheme in Standard Model.
Proceedings of the Provable Security - 6th International Conference, 2012

Cache Me If You Can: Capacitated Selfish Replication Games.
Proceedings of the LATIN 2012: Theoretical Informatics, 2012

Compact Stateful Encryption Schemes with Ciphertext Verifiability.
Proceedings of the Advances in Information and Computer Security, 2012

A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions.
Proceedings of the Information Security Practice and Experience, 2012

Obstacles Incentivize Human Learning: A Network Theoretic Study.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

A Navigation Algorithm Inspired by Human Navigation.
Proceedings of the International Conference on Advances in Social Networks Analysis and Mining, 2012

Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures.
Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model.
Proceedings of the Information Security and Privacy - 17th Australasian Conference, 2012

Group key establishment (GKE): Two/three party key exchange to GKE.
Proceedings of the IEEE International Conference on Advanced Networks and Telecommuncations Systems, 2012

2011
Secure message transmission in asynchronous networks.
J. Parallel Distrib. Comput., 2011

Variants of Spreading Messages.
J. Graph Algorithms Appl., 2011

Compact CCA-Secure Encryption with Ciphertext Verifiability.
IACR Cryptology ePrint Archive, 2011

On the Security of ID Based Signcryption Schemes.
IACR Cryptology ePrint Archive, 2011

Deterministic Identity Based Signature Scheme and its Application for Aggregate Signatures.
IACR Cryptology ePrint Archive, 2011

Identity Based Deterministic Signature Scheme Without Forking-Lemma.
IACR Cryptology ePrint Archive, 2011

Rational Secret Sharing with Honest Players over an Asynchronous Channel.
IACR Cryptology ePrint Archive, 2011

Rational Secret Sharing over an Asynchronous Broadcast Channel with Information Theoretic Security
CoRR, 2011

On the Fault Tolerance and Hamiltonicity of the Optical Transpose Interconnection System of Non-Hamiltonian Base Graphs
CoRR, 2011

A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs.
Proceedings of the WALCOM: Algorithms and Computation - 5th International Workshop, 2011

Bit-depth scalable video coding using error residual correction.
Proceedings of the 2011 IEEE Visual Communications and Image Processing, 2011

CCA Secure Certificateless Encryption Schemes based on RSA.
Proceedings of the SECRYPT 2011 - Proceedings of the International Conference on Security and Cryptography, Seville, Spain, 18, 2011

Identity-Based Deterministic Signature Scheme without Forking-Lemma.
Proceedings of the Advances in Information and Computer Security, 2011

Identity Based Online/Offline Encryption and Signcryption Schemes Revisited.
Proceedings of the Security Aspects in Information Technology, 2011

Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience.
Proceedings of the Information Theoretic Security - 5th International Conference, 2011

2010
On Conditional Covering Problem.
Mathematics in Computer Science, 2010

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

Collusion Free Protocol for Correlated Element Selection Problem.
IACR Cryptology ePrint Archive, 2010

Identity Based Partial Aggregate Signature Scheme Without Pairing.
IACR Cryptology ePrint Archive, 2010

A Suite of Identity Based Aggregate Signatures and a Multi-Signature Scheme from RSA.
IACR Cryptology ePrint Archive, 2010

CCA2 Secure Certificateless Encryption Schemes Based on RSA.
IACR Cryptology ePrint Archive, 2010

Identity Based Online/Offline Signcryption Scheme.
IACR Cryptology ePrint Archive, 2010

Identity Based Public Verifiable Signcryption Scheme.
IACR Cryptology ePrint Archive, 2010

Identity Based Online/Offline Encryption Scheme.
IACR Cryptology ePrint Archive, 2010

Security Weaknesses in Two Certificateless Signcryption Schemes.
IACR Cryptology ePrint Archive, 2010

On the Security of Identity Based Threshold Unsigncryption Schemes.
IACR Cryptology ePrint Archive, 2010

Identity Based Self Delegated Signature - Self Proxy Signatures.
IACR Cryptology ePrint Archive, 2010

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
IACR Cryptology ePrint Archive, 2010

Sanitizable signatures with strong transparency in the standard model.
IACR Cryptology ePrint Archive, 2010

Capacitated Caching Games
CoRR, 2010

Communication and Round Efficient Information Checking Protocol
CoRR, 2010

Towards a Cooperative Defense Model Against Network Security Attacks.
Proceedings of the 9th Annual Workshop on the Economics of Information Security, 2010

Variants of Spreading Messages.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

Pathwidth and Searching in Parameterized Threshold Graphs.
Proceedings of the WALCOM: Algorithms and Computation, 4th International Workshop, 2010

An Identity based Ring Signcryption Scheme with Public Verifiability.
Proceedings of the SECRYPT 2010, 2010

Forcing Out a Confession - Threshold Discernible Ring Signatures.
Proceedings of the SECRYPT 2010, 2010

Identity Based Public Verifiable Signcryption Scheme.
Proceedings of the Provable Security - 4th International Conference, 2010

Brief announcement: communication efficient asynchronous byzantine agreement.
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.
Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, 2010

Spatiogram Based Fast Mode Decision in Spatial Scalable Video Coding.
Proceedings of the Advances in Multimedia Information Processing - PCM 2010, 2010

On the Security of Identity Based Threshold Unsigncryption Schemes.
Proceedings of the Fourth International Conference on Network and System Security, 2010

Identity Based Self Delegated Signature - Self Proxy Signatures.
Proceedings of the Fourth International Conference on Network and System Security, 2010

Communication Optimal Multi-valued Asynchronous Broadcast Protocol.
Proceedings of the Progress in Cryptology, 2010

Certificateless KEM and Hybrid Signcryption Schemes Revisited.
Proceedings of the Information Security, 2010

Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles.
Proceedings of the Information Security, 2010

On Communication Complexity of Secure Message Transmission in Directed Networks.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

On Composability of Reliable Unicast and Broadcast.
Proceedings of the Distributed Computing and Networking, 11th International Conference, 2010

Attribute Based Signatures for Bounded Multi-level Threshold Circuits.
Proceedings of the Public Key Infrastructures, Services and Applications, 2010

The Round Complexity of Verifiable Secret Sharing: The Statistical Case.
Proceedings of the Advances in Cryptology - ASIACRYPT 2010, 2010

Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience.
Proceedings of the Progress in Cryptology, 2010

2009
Perfectly reliable and secure message transmission tolerating mobile adversary.
IJACT, 2009

Scalable Compilers for Group Key Establishment : Two/Three Party to Group.
IACR Cryptology ePrint Archive, 2009

ON THE SECURITY OF TWO RING SIGNCRYPTION SCHEMES.
IACR Cryptology ePrint Archive, 2009

Breaking and Building of Group Inside Signature.
IACR Cryptology ePrint Archive, 2009

Security Analysis of Aggregate signature and Batch verification signature schemes.
IACR Cryptology ePrint Archive, 2009

Certificateless KEM and Hybrid Signcryption Schemes Revisited.
IACR Cryptology ePrint Archive, 2009

A note on the Certificateless Multi-receiver Signcryption Scheme.
IACR Cryptology ePrint Archive, 2009

Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction Without Pairing.
IACR Cryptology ePrint Archive, 2009

Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.
IACR Cryptology ePrint Archive, 2009

On the security of Identity Based Ring Signcryption Schemes.
IACR Cryptology ePrint Archive, 2009

Communication Optimal Multi-Valued Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptology ePrint Archive, 2009

Efficient Statistical Asynchronous Verifiable Secret Sharing and Multiparty Computation with Optimal Resilience.
IACR Cryptology ePrint Archive, 2009

On The Communication Complexity of Perfectly Secure Message Transmission in Directed Networks.
IACR Cryptology ePrint Archive, 2009

Information Theoretically Secure Multi Party Set Intersection Re-Visited.
IACR Cryptology ePrint Archive, 2009

Unconditionally Secure Asynchronous Multiparty Computation with Quadratic Communication Per Multiplication Gate.
IACR Cryptology ePrint Archive, 2009

Multi Party Distributed Private Matching, Set Disjointness and Cardinality Set Intersection with Information Theoretic Security.
IACR Cryptology ePrint Archive, 2009

Game Theoretic Resistance to Denial of Service Attacks Using Hidden Difficulty Puzzles.
IACR Cryptology ePrint Archive, 2009

Core and Conditional Core Path of Specified Length in Special Classes of Graphs.
Proceedings of the WALCOM: Algorithms and Computation, Third International Workshop, 2009

Breaking and Building of Group Inside Signature.
Proceedings of the Security and Privacy in Communication Networks, 2009

On the Security of Two Ring Signcryption Schemes.
Proceedings of the SECRYPT 2009, 2009

Information Theoretically Secure Multi Party Set Intersection Re-visited.
Proceedings of the Selected Areas in Cryptography, 16th Annual International Workshop, 2009

Breaking and Fixing of an Identity Based Multi-Signcryption Scheme.
Proceedings of the Provable Security, Third International Conference, 2009

Brief announcement: perfectly secure message transmission in directed networks re-visited.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

Simple and efficient asynchronous byzantine agreement with optimal resilience.
Proceedings of the 28th Annual ACM Symposium on Principles of Distributed Computing, 2009

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers.
Proceedings of the Advances in Information and Computer Security, 2009

The Guarding Problem - Complexity and Approximation.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

On the Security of Identity Based Ring Signcryption Schemes.
Proceedings of the Information Security, 12th International Conference, 2009

Identity Based Aggregate Signcryption Schemes.
Proceedings of the Progress in Cryptology, 2009

Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience.
Proceedings of the Progress in Cryptology, 2009

Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience.
Proceedings of the Information Theoretic Security, 4th International Conference, 2009

On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks.
Proceedings of the Distributed Computing and Networking, 10th International Conference, 2009

The Round Complexity of Verifiable Secret Sharing Revisited.
Proceedings of the Advances in Cryptology, 2009

Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Breaking and Building of Threshold Signcryption Schemes.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Sanitizable Signatures with Strong Transparency in the Standard Model.
Proceedings of the Information Security and Cryptology - 5th International Conference, 2009

Unconditionally secure message transmission in arbitrary directed synchronous networks tolerating generalized mixed adversary.
Proceedings of the 2009 ACM Symposium on Information, Computer and Communications Security, 2009

Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security.
Proceedings of the Cryptology and Network Security, 8th International Conference, 2009

2008
Unconditionally Secure Message Transmission in Arbitrary Directed Synchronous Networks Tolerating Generalized Mixed Adversary.
IACR Cryptology ePrint Archive, 2008

Unconditionally Reliable Message Transmission in Directed Hypergraphs.
IACR Cryptology ePrint Archive, 2008

An Efficient Identity-Based Signcryption Scheme for Multiple Receivers.
IACR Cryptology ePrint Archive, 2008

Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-hoc Networks.
IACR Cryptology ePrint Archive, 2008

Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme.
IACR Cryptology ePrint Archive, 2008

On the Provable Security of Multi-Receiver Signcryption Schemes.
IACR Cryptology ePrint Archive, 2008

Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
IACR Cryptology ePrint Archive, 2008

Signcryption with Proxy Re-encryption.
IACR Cryptology ePrint Archive, 2008

On Communication Complexity of Perfectly Reliable and Secure Communication in Directed Networks.
IACR Cryptology ePrint Archive, 2008

Unconditionally Reliable and Secure Message Transmission in Undirected Synchronous Networks: Possibility, Feasibility and Optimality.
IACR Cryptology ePrint Archive, 2008

The Round Complexity of Verifiable Secret Sharing Revisited.
IACR Cryptology ePrint Archive, 2008

Unconditionally Secure Multiparty Set Intersection Re-Visited.
IACR Cryptology ePrint Archive, 2008

Efficient Asynchronous Multiparty Computation with Optimal Resilience.
IACR Cryptology ePrint Archive, 2008

Efficient Asynchronous Byzantine Agreement with Optimal Resilience.
IACR Cryptology ePrint Archive, 2008

Round Efficient Unconditionally Secure Multiparty Computation Protocol.
IACR Cryptology ePrint Archive, 2008

Statistically Reliable and Secure Message Transmission in Directed Networks.
IACR Cryptology ePrint Archive, 2008

Efficient Perfectly Reliable and Secure Communication Tolerating Mobile Adversary.
IACR Cryptology ePrint Archive, 2008

Perfectly Secure Message Transmission Tolerating Mixed Adversary.
IACR Cryptology ePrint Archive, 2008

Probabilistic Verifiable Secret Sharing Tolerating Adaptive Adversary.
IACR Cryptology ePrint Archive, 2008

Side Channel Attack Resistant Implementation of Multi-Power RSA using Hensel Lifting.
IACR Cryptology ePrint Archive, 2008

RSA-TBOS Signcryption with Proxy Re-encryption.
IACR Cryptology ePrint Archive, 2008

Foundations of Group Key Management - Framework, Security Model and a Generic Construction.
IACR Cryptology ePrint Archive, 2008

Cryptanalysis of Mu et al.'s and Li et al.'s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme.
Proceedings of the Information Security Applications, 9th International Workshop, 2008

Unconditionally reliable message transmission in directed networks.
Proceedings of the Nineteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2008

Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited.
Proceedings of the Security and Cryptography for Networks, 6th International Conference, 2008

Cryptanalysis of Bohio et al.'s ID-Based Broadcast Signcryption (IBBSC) Scheme for Wireless Ad-Hoc Networks.
Proceedings of the Sixth Annual Conference on Privacy, Security and Trust, 2008

Efficient and Provably Secure Certificateless Multi-receiver Signcryption.
Proceedings of the Provable Security, Second International Conference, 2008

Efficient single phase unconditionally secure message transmission with optimum communication complexity.
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.
Proceedings of the Twenty-Seventh Annual ACM Symposium on Principles of Distributed Computing, 2008

On Conditional Covering Problem.
Proceedings of the 19th International Workshop on Combinatorial Algorithms, 2008

Rational Secret Sharing with Repeated Games.
Proceedings of the Information Security Practice and Experience, 2008

The deterministic protocol for rational secret sharing.
Proceedings of the 22nd IEEE International Symposium on Parallel and Distributed Processing, 2008

Round Efficient Unconditionally Secure Multiparty Computation Protocol.
Proceedings of the Progress in Cryptology, 2008

Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary.
Proceedings of the Information Theoretic Security, Third International Conference, 2008

On Optimal Probabilistic Asynchronous Byzantine Agreement.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Alternative Protocols for Generalized Oblivious Transfer.
Proceedings of the Distributed Computing and Networking, 9th International Conference, 2008

Cryptanalysis of Li et al.'s Identity-Based Threshold Signcryption Scheme.
Proceedings of the 2008 IEEE/IPIP International Conference on Embedded and Ubiquitous Computing (EUC 2008), 2008

RSA-TBOS signcryption with proxy re-encryption.
Proceedings of the 8th ACM Workshop on Digital Rights Management, 2008

Unconditionally Reliable Message Transmission in Directed Hypergraphs.
Proceedings of the Cryptology and Network Security, 7th International Conference, 2008

Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary.
Proceedings of the Information Security and Privacy, 13th Australasian Conference, 2008

2007
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary.
Proceedings of the Distributed Computing, 21st International Symposium, 2007

On the Optimal Communication Complexity of Multiphase Protocols for Perfect Communication.
Proceedings of the 2007 IEEE Symposium on Security and Privacy (S&P 2007), 2007

Constant phase efficient protocols for secure message transmission in directed networks.
Proceedings of the Twenty-Sixth Annual ACM Symposium on Principles of Distributed Computing, 2007

Efficient Protocol For Approximate Agreement.
Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, 2007

Probabilistic Perfectly Reliable and Secure Message Transmission - Possibility, Feasibility and Optimality.
Proceedings of the Progress in Cryptology, 2007

On Exponential Lower Bound for Protocols for Reliable Communication in Networks.
Proceedings of the Information Theoretic Security - Second International Conference, 2007

Data structures for limited oblivious execution of programs while preserving locality of reference.
Proceedings of the Seventh ACM Workshop on Digital Rights Management, 2007

Privacy Preserving CACTUS Algorithm for Clustering over Vertically Partitioned Databases.
Proceedings of the 2007 International Conference on Data Mining, 2007

Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary.
Proceedings of the Cryptology and Network Security, 6th International Conference, 2007

Privacy Preserving BIRCH Algorithm for Clustering over Arbitrarily Partitioned Databases.
Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

Privacy Preserving DBSCAN Algorithm for Clustering.
Proceedings of the Advanced Data Mining and Applications, Third International Conference, 2007

On Proactive Perfectly Secure Message Transmission.
Proceedings of the Information Security and Privacy, 12th Australasian Conference, 2007

2006
Perfectly Reliable Message Transmission.
Inf. Process. Lett., 2006

Round-Optimal and Efficient Verifiable Secret Sharing.
Proceedings of the Theory of Cryptography, Third Theory of Cryptography Conference, 2006

Playing push vs pull: models and algorithms for disseminating dynamic data in networks.
Proceedings of the SPAA 2006: Proceedings of the 18th Annual ACM Symposium on Parallelism in Algorithms and Architectures, Cambridge, Massachusetts, USA, July 30, 2006

Privacy Preserving BIRCH Algorithm for Clustering over Vertically Partitioned Databases.
Proceedings of the Secure Data Management, Third VLDB Workshop, SDM 2006, Seoul, Korea, 2006

Possibility and complexity of probabilistic reliable communication in directed networks.
Proceedings of the Twenty-Fifth Annual ACM Symposium on Principles of Distributed Computing, 2006

Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission.
Proceedings of the Progress in Cryptology, 2006

Steganographic Communication in Ordered Channels.
Proceedings of the Information Hiding, 8th International Workshop, 2006

2004
Randomized Dictionary Structures.
Proceedings of the Handbook of Data Structures and Applications., 2004

Skew Heaps.
Proceedings of the Handbook of Data Structures and Applications., 2004

On Byzantine Agreement over (2, 3)-Uniform Hypergraphs.
Proceedings of the Distributed Computing, 18th International Conference, 2004

Brief announcement: on the round complexity of distributed consensus over synchronous networks.
Proceedings of the Twenty-Third Annual ACM Symposium on Principles of Distributed Computing, 2004

Optimal Perfectly Secure Message Transmission.
Proceedings of the Advances in Cryptology, 2004

2003
Brief announcement: efficient perfectly secure communication over synchronous networks.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

Distributed consensus in the presence of sectional faults.
Proceedings of the Twenty-Second ACM Symposium on Principles of Distributed Computing, 2003

On the Power of Computational Secret Sharing.
Proceedings of the Progress in Cryptology, 2003

Practical Pay TV Schemes.
Proceedings of the Information Security and Privacy, 8th Australasian Conference, 2003

2002
Trading Players for Efficiency in Unconditional Multiparty Computation.
Proceedings of the Security in Communication Networks, Third International Conference, 2002

On perfectly secure cmmunication over arbitrary networks.
Proceedings of the Twenty-First Annual ACM Symposium on Principles of Distributed Computing, 2002

Non-perfect Secret Sharing over General Access Structures.
Proceedings of the Progress in Cryptology, 2002

Asynchronous Unconditionally Secure Computation: An Efficiency Improvement.
Proceedings of the Progress in Cryptology, 2002

Theory of Equal-Flows in Networks.
Proceedings of the Computing and Combinatorics, 8th Annual International Conference, 2002

Asynchronous Secure Communication Tolerating Mixed Adversaries.
Proceedings of the Advances in Cryptology, 2002

Asynchronous Perfectly Secure Computation Tolerating Generalized Adversaries.
Proceedings of the Information Security and Privacy, 7th Australian Conference, 2002

2001
The Kr-Packing Problem.
Computing, 2001

Toward Optimal Player Weights in Secure Distributed Protocols.
Proceedings of the Progress in Cryptology, 2001

2000
On the Complexity of Partial Order Properties.
Order, 2000

On the Generative Power of Simple H Systems.
Journal of Automata, Languages and Combinatorics, 2000

Approximation algorithms for the Traveling Salesman Problem with range condition.
ITA, 2000

Algorithmic aspects of clique-transversal and clique-independent sets.
Discrete Applied Mathematics, 2000

Tolerating Generalized Mobile Adversaries in Secure Multiparty Computation.
Proceedings of the Progress in Cryptology, 2000

Efficient Asynchronous Secure Multiparty Distributed Computation.
Proceedings of the Progress in Cryptology, 2000

1999
Symmetric Min-Max Heap: A Simpler Data Structure for Double-Ended Priority Queue.
Inf. Process. Lett., 1999

1998
A Natural Family of Optimization Problems with Arbitrarily Small Approximation Thresholds.
Inf. Process. Lett., 1998

Weighted Irredundance of Interval Graphs.
Inf. Process. Lett., 1998

Partial and Perfect Path Covers of Cographs.
Discrete Applied Mathematics, 1998

On The g-centroidal Problem in Special Classes of Perfect Graphs.
Ars Comb., 1998

The Vertex-Disjoint Triangles Problem.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1998

Probabilistic Data Structures for Priority Queues (Extended Abstract).
Proceedings of the Algorithm Theory, 1998

The Colored Sector Search Tree: A Dynamic Data Structure for Efficient High Dimensional Nearest-Foreign-Neighbor Queries.
Proceedings of the Computing and Combinatorics, 4th Annual International Conference, 1998

1997
Restrictions of Minimum Spanner Problems.
Inf. Comput., 1997

An optimal parallel algorithm for the all-nearest-foreign-neighbors problem in arbitrary dimensions.
Proceedings of the Fourth International on High-Performance Computing, 1997

1996
Approximate Triclique Coloring for Register Allocation.
Inf. Process. Lett., 1996

Tree 3-Spanners on Interval, Permutation and Regular Bipartite Graphs.
Inf. Process. Lett., 1996

Clique Transversal and Clique Independence on Comparability Graphs.
Inf. Process. Lett., 1996

An Efficient Distributed Algorithm for Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett., 1996

The Parity Path Problem on Some Subclasses of Perfect Graphs.
Discrete Applied Mathematics, 1996

All-pairs-shortest-length on Strongly Chordal Graphs.
Discrete Applied Mathematics, 1996

Optimal Parallel Algorithm for Finding st-Ambitus of a Planar Biconnected Graph.
Algorithmica, 1996

1995
Optimal Parallel Algorithms for Path Problems on Planar Graphs.
Theor. Comput. Sci., 1995

Systematic Design of an Algorithm for Biconnected Components.
Sci. Comput. Program., 1995

Performance Bounds for Static Multiprocessor Scheduling of Multi-Task Jobs.
Parallel Processing Letters, 1995

An Efficient Randomized Algorithm for the Closest Pair Problem on Colored Point Sets.
Nord. J. Comput., 1995

Feedback vertex set on cocomparability graphs.
Networks, 1995

An Efficient Distributed Algorithm For st-numbering The Verices Of A Biconnected Graph
J. UCS, 1995

Efficient Parallel Algorithms for Permutation Graphs.
J. Parallel Distrib. Comput., 1995

Parallel Algorithms on Interval Graphs.
ITA, 1995

Edge Domination on Bipartite Permutation Graphs and Cotriangulated Graphs.
Inf. Process. Lett., 1995

Efficient Dynamic Job Scheduling Algorithms for Multiprocessor Systems.
IEICE Transactions, 1995

Efficient algorithms for minimal disjoint path problems on chordal graphs.
Discussiones Mathematicae Graph Theory, 1995

A linear algorithms for the two paths problem on permutation graphs.
Discussiones Mathematicae Graph Theory, 1995

Edge-disjoint paths in permutation graphs.
Discussiones Mathematicae Graph Theory, 1995

Weighted Independent Perfect Domination on Cocomparability Graphs.
Discrete Applied Mathematics, 1995

Efficient Randomized Incremental Algorithm For The Closest Pair Problem Using Leafary Trees.
Proceedings of the Computing and Combinatorics, First Annual International Conference, 1995

1994
Treewidth of Circular-Arc Graphs.
SIAM J. Discrete Math., 1994

Efficient Parallel Shuffle Recognition.
Parallel Processing Letters, 1994

A Linear Algorithm for Centering a Spanning Tree of a Biconnected Graph.
Inf. Process. Lett., 1994

Weighted Irredundance of Interval Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Edge-Disjoint Paths in Permutation Graphs.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Efficient Randomized Parallel Algorithm for the Closest Pair Problem in D-dimension.
Proceedings of the Technology and Foundations - Information Processing '94, Volume 1, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Optimal Path Cover Problem on Block Graphs and Bipartite Permutation Graphs.
Theor. Comput. Sci., 1993

A Unified Approach to Parallel Algorithms for the Domatic Partition Problem on Special Classes of Perfect Graphs.
Parallel Processing Letters, 1993

A Linear Algorithm for the All-Bidirectional-Edges Problem on Planar Graphs.
Algorithmica, 1993

Connected Domination and Steiner Set on Asteroidal Triple-Free Graphs.
Proceedings of the Algorithms and Data Structures, Third Workshop, 1993

Weighted Independent Perfect Domination on Cocomparability Graphs.
Proceedings of the Algorithms and Computation, 4th International Symposium, 1993

1992
An optimal algorithm to solve the all-pair shortest path problem on interval graphs.
Networks, 1992

An Optimal Algorithm for Reconstructing a Binary Tree.
Inf. Process. Lett., 1992

An O(n log n) algorithm for a maxmin location problem.
Discrete Applied Mathematics, 1992

Generalized Vertex Covering in Interval Graphs.
Discrete Applied Mathematics, 1992

A Parallel Algorithm for Recognizing the Shuffle of Two Strings.
Proceedings of the 6th International Parallel Processing Symposium, 1992

1991
On Finding the Minimum Bandwidth of Interval Graphs
Inf. Comput., December, 1991

Efficient Algorithms for the Minimum Weighted Dominating Clique Problem on Permutation Graphs.
Theor. Comput. Sci., 1991

An efficient algorithm for finding a two-pair, and its applications.
Discrete Applied Mathematics, 1991

Efficient Reduction for Path Problems on Circular-Arc Graphs.
BIT, 1991

Treewidth of Circular-Arc Graphs (Abstract).
Proceedings of the Algorithms and Data Structures, 1991

1990
New Sequential and Parallel Algorithms for Interval Graph Recognition.
Inf. Process. Lett., 1990

Linear Algorithm for Optimal Path Cover Problem on Interval Graphs.
Inf. Process. Lett., 1990

A Fast Algorithm for Computing Sparse Visibility Graphs.
Algorithmica, 1990

Parallel Algorithms on Interval Graphs.
Proceedings of the 1990 International Conference on Parallel Processing, 1990

1989
Algorithms for Weighted Graph Problems on The Modified Cellular Graph Automaton.
ITA, 1989

Optimal Parallel Algorithms on Circular-Arc Graphs.
Inf. Process. Lett., 1989

Linear Algorithm for Domatic Number Problem on Interval Graphs.
Inf. Process. Lett., 1989

Linear Algorithms for Parity Path and Two Path Problems on Circular-Arc Graph.
Proceedings of the Algorithms and Data Structures, 1989

Optimal Parallel Algorithms on Circular-Arc Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1989

1988
A Unified Approach to Domination Problems on Interval Graphs.
Inf. Process. Lett., 1988

Total Domination in Interval Graphs Revisited.
Inf. Process. Lett., 1988

A New Linear Algorithm for the Two Path Problem on Chordal Graphs.
Proceedings of the Foundations of Software Technology and Theoretical Computer Science, 1988

1987
A Linear Space Algorithm for the LCS Problem.
Acta Inf., 1987

Competitive Location in the L1 and LINF Metrics.
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

New Parallel Algorithms for the Maximum Empty Rectangle Problem.
Proceedings of the International Conference on Parallel Processing, 1987

1986
A Simple Implementation of Warshall's Algorithm on a VLSI Chip.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

1983
On the Minimum Number of Additions Required to Compute a Quadratic Form.
J. Algorithms, 1983


  Loading...