| Publication | Date of Publication | Type |
|---|
| Forward security under leakage resilience, revisited | 2024-06-05 | Paper |
Efficient randomized incremental algorithm for the closest pair problem using Leafary trees
Lecture Notes in Computer Science | 2023-12-12 | Paper |
An efficient attribute-based authenticated key exchange protocol
Cryptology and Network Security | 2023-08-02 | Paper |
Connected domination and steiner set on asteroidal triple-free graphs
Lecture Notes in Computer Science | 2023-01-18 | Paper |
| Efficient attribute-based proxy re-encryption with constant size ciphertexts | 2022-07-06 | Paper |
| Efficiently obfuscating re-encryption program under DDH assumption | 2022-07-01 | Paper |
New approach to practical leakage-resilient public-key cryptography
Journal of Mathematical Cryptology | 2021-05-03 | Paper |
Identity-based group encryption revisited
Information and Communications Security | 2020-07-20 | Paper |
Sharing of encrypted files in blockchain made simpler
Mathematical Research for Blockchain Economy | 2020-06-29 | Paper |
Smart contract-driven mechanism design to mitigate information diffusion in social networks
Mathematical Research for Blockchain Economy | 2020-06-29 | Paper |
Cache me if you can: capacitated selfish replication games in networks
Theory of Computing Systems | 2020-02-27 | Paper |
| Public key encryption resilient to post-challenge leakage and tampering attacks | 2020-01-28 | Paper |
| A CCA-secure collusion-resistant identity-based proxy re-encryption scheme | 2018-11-07 | Paper |
| Leakage-resilient non-interactive key exchange in the continuous-memory leakage setting | 2018-11-07 | Paper |
| An efficient certificateless proxy re-encryption scheme without pairing | 2018-11-07 | Paper |
| scientific article; zbMATH DE number 6876062 (Why is no real title available?) | 2018-05-29 | Paper |
| scientific article; zbMATH DE number 6876070 (Why is no real title available?) | 2018-05-29 | Paper |
| Efficient compilers for after-the-fact leakage: from CPA to CCA-2 secure PKE to AKE | 2017-08-25 | Paper |
A natural family of optimization problems with arbitrarily small approximation thresholds
Information Processing Letters | 2016-06-09 | Paper |
Lattice-based identity-based resplittable threshold public key encryption scheme
International Journal of Computer Mathematics | 2016-05-06 | Paper |
Forward-secure authenticated symmetric key exchange protocol: new security model and secure construction
Provable Security | 2016-01-27 | Paper |
Constant size ring signature without random oracle
Information Security and Privacy | 2015-10-20 | Paper |
A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory
Information Security and Cryptology -- ICISC 2013 | 2015-10-16 | Paper |
Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model
Information Security and Cryptology -- ICISC 2013 | 2015-10-16 | Paper |
Efficient asynchronous verifiable secret sharing and multiparty computation
Journal of Cryptology | 2015-03-25 | Paper |
Possibility and complexity of probabilistic reliable communication in directed networks
Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing | 2015-03-10 | Paper |
Brief announcement: communication efficient asynchronous Byzantine agreement
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing | 2015-03-02 | Paper |
On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Efficient single phase unconditionally secure message transmission with optimum communication complexity
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing | 2014-12-12 | Paper |
Identity-based identification schemes from ID-kems
Security, Privacy, and Applied Cryptography Engineering | 2014-09-15 | Paper |
Anonymous identity-based identification scheme in ad-hoc groups without pairings
Security, Privacy, and Applied Cryptography Engineering | 2014-09-15 | Paper |
On perfectly secure communication over arbitrary networks
Proceedings of the twenty-first annual symposium on Principles of distributed computing | 2014-07-25 | Paper |
Simple and efficient asynchronous Byzantine agreement with optimal resilience
Proceedings of the 28th ACM symposium on Principles of distributed computing | 2014-07-23 | Paper |
Asynchronous Byzantine agreement with optimal resilience
Distributed Computing | 2014-07-11 | Paper |
Constant phase efficient protocols for secure message transmission in directed networks
Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing | 2014-03-13 | Paper |
On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission
Journal of the ACM | 2014-02-17 | Paper |
Variants of spreading messages
Journal of Graph Algorithms and Applications | 2013-11-28 | Paper |
Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round
Provable Security | 2013-10-23 | Paper |
Compact stateful encryption schemes with ciphertext verifiability
Advances in Information and Computer Security | 2013-04-04 | Paper |
| Identity based ring signcryption schemes revisited | 2013-01-25 | Paper |
ID based signcryption scheme in standard model
Provable Security | 2012-11-06 | Paper |
An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model
Information Security and Privacy | 2012-09-07 | Paper |
Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures
Information Security and Privacy | 2012-09-07 | Paper |
Cache me if you can: capacitated selfish replication games
LATIN 2012: Theoretical Informatics | 2012-06-29 | Paper |
A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions
Information Security Practice and Experience | 2012-06-29 | Paper |
Identity-based deterministic signature scheme without forking-lemma
Advances in Information and Computer Security | 2011-11-10 | Paper |
Secure message transmission in asynchronous networks
Journal of Parallel and Distributed Computing | 2011-08-19 | Paper |
Communication optimal multi-valued asynchronous Byzantine agreement with optimal resilience
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality
International Journal of Applied Cryptography | 2011-04-05 | Paper |
A polynomial time algorithm for longest paths in biconvex graphs
WALCOM: Algorithms and Computation | 2011-02-20 | Paper |
On conditional covering problem
Mathematics in Computer Science | 2011-02-19 | Paper |
The round complexity of verifiable secret sharing: the statistical case
Advances in Cryptology - ASIACRYPT 2010 | 2010-12-07 | Paper |
Cryptanalysis of certificateless signcryption schemes and an efficient construction without pairing
Information Security and Cryptology | 2010-11-23 | Paper |
Communication efficient statistical asynchronous multiparty computation with optimal resilience
Information Security and Cryptology | 2010-11-23 | Paper |
Sanitizable signatures with strong transparency in the standard model
Information Security and Cryptology | 2010-11-23 | Paper |
Breaking and building of threshold signcryption schemes
Information Security and Cryptology | 2010-11-23 | Paper |
Identity based public verifiable signcryption scheme
Provable Security | 2010-10-12 | Paper |
Efficient statistical asynchronous verifiable secret sharing with optimal resilience
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Communication optimal multi-valued asynchronous broadcast protocol
Lecture Notes in Computer Science | 2010-08-31 | Paper |
| scientific article; zbMATH DE number 5764833 (Why is no real title available?) | 2010-08-06 | Paper |
Communication efficient perfectly secure VSS and MPC in asynchronous networks with optimal resilience
Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings | 2010-05-04 | Paper |
Variants of spreading messages
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Pathwidth and searching in parameterized threshold graphs
WALCOM: Algorithms and Computation | 2010-02-09 | Paper |
Perfectly reliable message transmission
Information Processing Letters | 2010-01-29 | Paper |
Identity based aggregate signcryption schemes
Progress in Cryptology - INDOCRYPT 2009 | 2009-12-17 | Paper |
Round efficient unconditionally secure MPC and multiparty set intersection with optimal resilience
Progress in Cryptology - INDOCRYPT 2009 | 2009-12-17 | Paper |
The guarding problem -- complexity and approximation
Lecture Notes in Computer Science | 2009-12-11 | Paper |
Breaking and fixing of an identity based multi-signcryption scheme
Provable Security | 2009-12-11 | Paper |
Information Theoretically Secure Multi Party Set Intersection Re-visited
Selected Areas in Cryptography | 2009-12-09 | Paper |
On exponential lower bound for protocols for reliable communication in networks
Lecture Notes in Computer Science | 2009-12-03 | Paper |
Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security
Cryptology and Network Security | 2009-11-26 | Paper |
An Efficient Identity-Based Signcryption Scheme for Multiple Receivers
Advances in Information and Computer Security | 2009-10-28 | Paper |
The Round Complexity of Verifiable Secret Sharing Revisited
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
On the Security of Identity Based Ring Signcryption Schemes
Lecture Notes in Computer Science | 2009-09-29 | Paper |
Perfectly reliable and secure message transmission tolerating mobile adversary
International Journal of Applied Cryptography | 2009-05-12 | Paper |
On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks
Distributed Computing and Networking | 2009-03-26 | Paper |
On Proactive Perfectly Secure Message Transmission
Information Security and Privacy | 2009-03-06 | Paper |
Cryptanalysis of Mu et al.’s and Li et al.’s Schemes and a Provably Secure ID-Based Broadcast Signcryption (IBBSC) Scheme
Information Security Applications | 2009-02-24 | Paper |
Efficient and Provably Secure Certificateless Multi-receiver Signcryption
Provable Security | 2009-01-27 | Paper |
Round Efficient Unconditionally Secure Multiparty Computation Protocol
Progress in Cryptology - INDOCRYPT 2008 | 2009-01-22 | Paper |
Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary
Lecture Notes in Computer Science | 2009-01-09 | Paper |
Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited
Lecture Notes in Computer Science | 2008-11-20 | Paper |
Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary
Lecture Notes in Computer Science | 2008-09-02 | Paper |
Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary
Information Security and Privacy | 2008-07-08 | Paper |
Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary
Cryptology and Network Security | 2008-04-15 | Paper |
Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission
Progress in Cryptology - INDOCRYPT 2006 | 2008-04-11 | Paper |
Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality
Lecture Notes in Computer Science | 2008-04-11 | Paper |
Alternative Protocols for Generalized Oblivious Transfer
Distributed Computing and Networking | 2008-03-06 | Paper |
On Optimal Probabilistic Asynchronous Byzantine Agreement
Distributed Computing and Networking | 2008-03-06 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Weighted irredundance of interval graphs.
Information Processing Letters | 2006-01-17 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2090007 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2043321 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1955808 (Why is no real title available?) | 2003-07-29 | Paper |
| scientific article; zbMATH DE number 1950364 (Why is no real title available?) | 2003-07-17 | Paper |
Asynchronous Secure Communication Tolerating Mixed Adversaries
Lecture Notes in Computer Science | 2003-07-16 | Paper |
| scientific article; zbMATH DE number 1857530 (Why is no real title available?) | 2003-01-28 | Paper |
The \(K_r\)-packing problem
Computing | 2002-01-24 | Paper |
| scientific article; zbMATH DE number 1583939 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1583940 (Why is no real title available?) | 2001-07-08 | Paper |
On the complexity of partial order properties
Order | 2001-06-28 | Paper |
On the g-centroidal problem in special classes of perfect graphs
Ars Combinatoria | 2001-06-10 | Paper |
| scientific article; zbMATH DE number 1542851 (Why is no real title available?) | 2001-02-26 | Paper |
| scientific article; zbMATH DE number 1555936 (Why is no real title available?) | 2001-01-24 | Paper |
| scientific article; zbMATH DE number 1555977 (Why is no real title available?) | 2001-01-24 | Paper |
Approximation Algorithms for the Traveling Salesman Problem with Range Condition
RAIRO - Theoretical Informatics and Applications | 2000-12-19 | Paper |
Approximation Algorithms for the Traveling Salesman Problem with Range Condition
RAIRO - Theoretical Informatics and Applications | 2000-12-19 | Paper |
Edge-disjoint paths in permutation graphs
Discussiones Mathematicae Graph Theory | 2000-11-30 | Paper |
Algorithmic aspects of clique-transversal and clique-independent sets
Discrete Applied Mathematics | 2000-11-30 | Paper |
A linear algorithm for centering a spanning tree of a biconnected graph
Information Processing Letters | 2000-11-30 | Paper |
Feedback vertex set on cocomparability graphs
Networks | 2000-11-30 | Paper |
| scientific article; zbMATH DE number 1530304 (Why is no real title available?) | 2000-11-14 | Paper |
| scientific article; zbMATH DE number 1419239 (Why is no real title available?) | 2000-05-11 | Paper |
| scientific article; zbMATH DE number 1354118 (Why is no real title available?) | 1999-10-31 | Paper |
| scientific article; zbMATH DE number 1262785 (Why is no real title available?) | 1999-08-17 | Paper |
Symmetric min-max heap: a simpler data structure for double-ended priority queue
Information Processing Letters | 1999-04-28 | Paper |
Parallel algorithms on interval graphs
RAIRO - Theoretical Informatics and Applications | 1998-01-29 | Paper |
Restrictions of minimum spanner problems
Information and Computation | 1997-12-14 | Paper |
The parity path problem on some subclasses of perfect graphs
Discrete Applied Mathematics | 1997-04-07 | Paper |
Edge domination on bipartite permutation graphs and cotriangulated graphs
Information Processing Letters | 1997-02-28 | Paper |
Optimal parallel algorithms for path problems on planar graphs
Theoretical Computer Science | 1997-02-28 | Paper |
Approximate triclique coloring for register allocation
Information Processing Letters | 1997-02-28 | Paper |
Tree 3-spanners on interval, permutation and regular bipartite graphs
Information Processing Letters | 1997-02-27 | Paper |
An efficient distributed algorithm for centering a spanning tree of a biconnected graph
Information Processing Letters | 1997-02-27 | Paper |
All-pairs-shortest-length on strongly chordal graphs
Discrete Applied Mathematics | 1996-10-09 | Paper |
A linear algorithms for the two paths problem on permutation graphs
Discussiones Mathematicae Graph Theory | 1996-08-26 | Paper |
Efficient algorithms for minimal disjoint path problems on chordal graphs
Discussiones Mathematicae Graph Theory | 1996-08-26 | Paper |
Weighted independent perfect domination on cocomparability graphs
Discrete Applied Mathematics | 1996-08-05 | Paper |
| scientific article; zbMATH DE number 794264 (Why is no real title available?) | 1996-05-28 | Paper |
Efficient parallel algorithms for permutation graphs
Journal of Parallel and Distributed Computing | 1995-07-06 | Paper |
Treewidth of Circular-Arc Graphs
SIAM Journal on Discrete Mathematics | 1994-12-20 | Paper |
A linear algorithm for the all-bidirectional-edges problem on planar graphs
Algorithmica | 1993-05-16 | Paper |
| scientific article; zbMATH DE number 140475 (Why is no real title available?) | 1993-03-28 | Paper |
Generalized vertex covering in interval graphs
Discrete Applied Mathematics | 1993-01-16 | Paper |
An optimal algorithm for reconstructing a binary tree
Information Processing Letters | 1993-01-16 | Paper |
An O\((n \log{}n)\) algorithm for a maxmin location problem
Discrete Applied Mathematics | 1992-09-27 | Paper |
An optimal algorithm to solve the all-pair shortest path problem on interval graphs
Networks | 1992-06-28 | Paper |
On finding the minimum bandwidth of interval graphs
Information and Computation | 1992-06-28 | Paper |
An efficient algorithm for finding a two-pair, and its applications
Discrete Applied Mathematics | 1992-06-25 | Paper |
Efficient reduction for path problems on circular-arc graphs
BIT | 1991-01-01 | Paper |
Linear algorithm for optimal path cover problem on interval graphs
Information Processing Letters | 1990-01-01 | Paper |
New sequential and parallel algorithms for interval graph recognition
Information Processing Letters | 1990-01-01 | Paper |
A fast algorithm for computing sparse visibility graphs
Algorithmica | 1990-01-01 | Paper |
| scientific article; zbMATH DE number 4215389 (Why is no real title available?) | 1989-01-01 | Paper |
Linear algorithm for domatic number problem on interval graphs
Information Processing Letters | 1989-01-01 | Paper |
Optimal parallel algorithms on circular-arc graphs
Information Processing Letters | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4064727 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 4054924 (Why is no real title available?) | 1988-01-01 | Paper |
A unified approach to domination problems on interval graphs
Information Processing Letters | 1988-01-01 | Paper |
Total domination in interval graphs revisited
Information Processing Letters | 1988-01-01 | Paper |
Matrix transposition in a magnetic bubble memory
International Journal of Computer Mathematics | 1988-01-01 | Paper |
A linear space algorithm for the LCS problem
Acta Informatica | 1987-01-01 | Paper |
On the minimum number of additions required to compute a quadratic form
Journal of Algorithms | 1983-01-01 | Paper |
