| Publication | Date of Publication | Type |
|---|
| Efficient randomized incremental algorithm for the closest pair problem using Leafary trees | 2023-12-12 | Paper |
| An efficient attribute-based authenticated key exchange protocol | 2023-08-02 | Paper |
| Connected domination and steiner set on asteroidal triple-free graphs | 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 | 2021-05-03 | Paper |
| Identity-Based Group Encryption Revisited | 2020-07-20 | Paper |
| Sharing of Encrypted Files in Blockchain Made Simpler | 2020-06-29 | Paper |
| Smart Contract-Driven Mechanism Design to Mitigate Information Diffusion in Social Networks | 2020-06-29 | Paper |
| Cache me if you can: capacitated selfish replication games in networks | 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 |
| https://portal.mardi4nfdi.de/entity/Q4643831 | 2018-05-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4643839 | 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 | 2016-06-09 | Paper |
| Forward-Secure Authenticated Symmetric Key Exchange Protocol: New Security Model and Secure Construction | 2016-01-27 | Paper |
| Constant Size Ring Signature Without Random Oracle | 2015-10-20 | Paper |
| A Provably Secure Signature and Signcryption Scheme Using the Hardness Assumptions in Coding Theory | 2015-10-16 | Paper |
| Efficient Code Based Hybrid and Deterministic Encryptions in the Standard Model | 2015-10-16 | Paper |
| Efficient asynchronous verifiable secret sharing and multiparty computation | 2015-03-25 | Paper |
| Possibility and complexity of probabilistic reliable communication in directed networks | 2015-03-10 | Paper |
| Brief announcement | 2015-03-02 | Paper |
| On tradeoff between network connectivity, phase complexity and communication complexity of reliable communication tolerating mixed adversary | 2014-12-12 | Paper |
| Efficient single phase unconditionally secure message transmission with optimum communication complexity | 2014-12-12 | Paper |
| Identity-Based Identification Schemes from ID-KEMs | 2014-09-15 | Paper |
| Anonymous Identity-Based Identification Scheme in Ad-Hoc Groups without Pairings | 2014-09-15 | Paper |
| On perfectly secure communication over arbitrary networks | 2014-07-25 | Paper |
| Simple and efficient asynchronous byzantine agreement with optimal resilience | 2014-07-23 | Paper |
| Asynchronous Byzantine agreement with optimal resilience | 2014-07-11 | Paper |
| Constant phase efficient protocols for secure message transmission in directed networks | 2014-03-13 | Paper |
| On the trade-off between network connectivity, round complexity, and communication complexity of reliable message transmission | 2014-02-17 | Paper |
| Variants of Spreading Messages | 2013-11-28 | Paper |
| Efficient, Pairing-Free, Authenticated Identity Based Key Agreement in a Single Round | 2013-10-23 | Paper |
| Compact Stateful Encryption Schemes with Ciphertext Verifiability | 2013-04-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4902121 | 2013-01-25 | Paper |
| ID Based Signcryption Scheme in Standard Model | 2012-11-06 | Paper |
| An Efficient IND-CCA2 Secure Variant of the Niederreiter Encryption Scheme in the Standard Model | 2012-09-07 | Paper |
| Deterministic Identity Based Signature Scheme and Its Application for Aggregate Signatures | 2012-09-07 | Paper |
| A Code-Based 1-out-of-N Oblivious Transfer Based on McEliece Assumptions | 2012-06-29 | Paper |
| Cache Me If You Can: Capacitated Selfish Replication Games | 2012-06-29 | Paper |
| Identity-Based Deterministic Signature Scheme without Forking-Lemma | 2011-11-10 | Paper |
| Secure message transmission in asynchronous networks | 2011-08-19 | Paper |
| Communication Optimal Multi-valued Asynchronous Byzantine Agreement with Optimal Resilience | 2011-05-19 | Paper |
| Unconditionally reliable and secure message transmission in undirected synchronous networks: possibility, feasibility and optimality | 2011-04-05 | Paper |
| A Polynomial Time Algorithm for Longest Paths in Biconvex Graphs | 2011-02-20 | Paper |
| On conditional covering problem | 2011-02-19 | Paper |
| The Round Complexity of Verifiable Secret Sharing: The Statistical Case | 2010-12-07 | Paper |
| Cryptanalysis of Certificateless Signcryption Schemes and an Efficient Construction without Pairing | 2010-11-23 | Paper |
| Sanitizable Signatures with Strong Transparency in the Standard Model | 2010-11-23 | Paper |
| Breaking and Building of Threshold Signcryption Schemes | 2010-11-23 | Paper |
| Communication Efficient Statistical Asynchronous Multiparty Computation with Optimal Resilience | 2010-11-23 | Paper |
| Identity Based Public Verifiable Signcryption Scheme | 2010-10-12 | Paper |
| Efficient Statistical Asynchronous Verifiable Secret Sharing with Optimal Resilience | 2010-09-29 | Paper |
| Communication Optimal Multi-valued Asynchronous Broadcast Protocol | 2010-08-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3579425 | 2010-08-06 | Paper |
| Communication Efficient Perfectly Secure VSS and MPC in Asynchronous Networks with Optimal Resilience | 2010-05-04 | Paper |
| Variants of Spreading Messages | 2010-02-09 | Paper |
| Pathwidth and Searching in Parameterized Threshold Graphs | 2010-02-09 | Paper |
| Perfectly reliable message transmission | 2010-01-29 | Paper |
| Identity Based Aggregate Signcryption Schemes | 2009-12-17 | Paper |
| Round Efficient Unconditionally Secure MPC and Multiparty Set Intersection with Optimal Resilience | 2009-12-17 | Paper |
| The Guarding Problem – Complexity and Approximation | 2009-12-11 | Paper |
| Breaking and Fixing of an Identity Based Multi-Signcryption Scheme | 2009-12-11 | Paper |
| Information Theoretically Secure Multi Party Set Intersection Re-visited | 2009-12-09 | Paper |
| On Exponential Lower Bound for Protocols for Reliable Communication in Networks | 2009-12-03 | Paper |
| Multi Party Distributed Private Matching, Set Disjointness and Cardinality of Set Intersection with Information Theoretic Security | 2009-11-26 | Paper |
| An Efficient Identity-Based Signcryption Scheme for Multiple Receivers | 2009-10-28 | Paper |
| The Round Complexity of Verifiable Secret Sharing Revisited | 2009-10-20 | Paper |
| On the Security of Identity Based Ring Signcryption Schemes | 2009-09-29 | Paper |
| Perfectly reliable and secure message transmission tolerating mobile adversary | 2009-05-12 | Paper |
| On Minimal Connectivity Requirement for Secure Message Transmission in Asynchronous Networks | 2009-03-26 | Paper |
| On Proactive Perfectly Secure Message Transmission | 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 | 2009-02-24 | Paper |
| Efficient and Provably Secure Certificateless Multi-receiver Signcryption | 2009-01-27 | Paper |
| Round Efficient Unconditionally Secure Multiparty Computation Protocol | 2009-01-22 | Paper |
| Perfectly Reliable and Secure Communication Tolerating Static and Mobile Mixed Adversary | 2009-01-09 | Paper |
| Unconditionally Reliable and Secure Message Transmission in Directed Networks Revisited | 2008-11-20 | Paper |
| Perfectly Reliable and Secure Communication in Directed Networks Tolerating Mixed Adversary | 2008-09-02 | Paper |
| Efficient Perfectly Reliable and Secure Message Transmission Tolerating Mobile Adversary | 2008-07-08 | Paper |
| Perfectly Secure Message Transmission in Directed Networks Tolerating Threshold and Non Threshold Adversary | 2008-04-15 | Paper |
| Probabilistic Perfectly Reliable and Secure Message Transmission – Possibility, Feasibility and Optimality | 2008-04-11 | Paper |
| Constant Phase Bit Optimal Protocols for Perfectly Reliable and Secure Message Transmission | 2008-04-11 | Paper |
| On Optimal Probabilistic Asynchronous Byzantine Agreement | 2008-03-06 | Paper |
| Alternative Protocols for Generalized Oblivious Transfer | 2008-03-06 | Paper |
| Theory of Cryptography | 2007-02-12 | Paper |
| Weighted irredundance of interval graphs. | 2006-01-17 | Paper |
| Advances in Cryptology – CRYPTO 2004 | 2005-08-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808674 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4450745 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4417424 | 2003-07-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413003 | 2003-07-17 | Paper |
| Asynchronous Secure Communication Tolerating Mixed Adversaries | 2003-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4788579 | 2003-01-28 | Paper |
| The \(K_r\)-packing problem | 2002-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707598 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2707599 | 2001-07-08 | Paper |
| On the complexity of partial order properties | 2001-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4520304 | 2001-02-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525703 | 2001-01-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4525750 | 2001-01-24 | Paper |
| Approximation Algorithms for the Traveling Salesman Problem with Range Condition | 2000-12-19 | Paper |
| Edge-disjoint paths in permutation graphs | 2000-11-30 | Paper |
| Feedback vertex set on cocomparability graphs | 2000-11-30 | Paper |
| A linear algorithm for centering a spanning tree of a biconnected graph | 2000-11-30 | Paper |
| Algorithmic aspects of clique-transversal and clique-independent sets | 2000-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4514739 | 2000-11-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4942257 | 2000-05-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4268431 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4232775 | 1999-08-17 | Paper |
| Symmetric min-max heap: a simpler data structure for double-ended priority queue | 1999-04-28 | Paper |
| Parallel algorithms on interval graphs | 1998-01-29 | Paper |
| Restrictions of minimum spanner problems | 1997-12-14 | Paper |
| The parity path problem on some subclasses of perfect graphs | 1997-04-07 | Paper |
| Edge domination on bipartite permutation graphs and cotriangulated graphs | 1997-02-28 | Paper |
| Optimal parallel algorithms for path problems on planar graphs | 1997-02-28 | Paper |
| Approximate triclique coloring for register allocation | 1997-02-28 | Paper |
| Tree 3-spanners on interval, permutation and regular bipartite graphs | 1997-02-27 | Paper |
| An efficient distributed algorithm for centering a spanning tree of a biconnected graph | 1997-02-27 | Paper |
| All-pairs-shortest-length on strongly chordal graphs | 1996-10-09 | Paper |
| Efficient algorithms for minimal disjoint path problems on chordal graphs | 1996-08-26 | Paper |
| A linear algorithms for the two paths problem on permutation graphs | 1996-08-26 | Paper |
| Weighted independent perfect domination on cocomparability graphs | 1996-08-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847025 | 1996-05-28 | Paper |
| Efficient parallel algorithms for permutation graphs | 1995-07-06 | Paper |
| Treewidth of Circular-Arc Graphs | 1994-12-20 | Paper |
| A linear algorithm for the all-bidirectional-edges problem on planar graphs | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4028893 | 1993-03-28 | Paper |
| An optimal algorithm for reconstructing a binary tree | 1993-01-16 | Paper |
| Generalized vertex covering in interval graphs | 1993-01-16 | Paper |
| An O\((n \log{}n)\) algorithm for a maxmin location problem | 1992-09-27 | Paper |
| On finding the minimum bandwidth of interval graphs | 1992-06-28 | Paper |
| An optimal algorithm to solve the all-pair shortest path problem on interval graphs | 1992-06-28 | Paper |
| An efficient algorithm for finding a two-pair, and its applications | 1992-06-25 | Paper |
| Efficient reduction for path problems on circular-arc graphs | 1991-01-01 | Paper |
| Linear algorithm for optimal path cover problem on interval graphs | 1990-01-01 | Paper |
| New sequential and parallel algorithms for interval graph recognition | 1990-01-01 | Paper |
| A fast algorithm for computing sparse visibility graphs | 1990-01-01 | Paper |
| Linear algorithm for domatic number problem on interval graphs | 1989-01-01 | Paper |
| Optimal parallel algorithms on circular-arc graphs | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3361906 | 1989-01-01 | Paper |
| A unified approach to domination problems on interval graphs | 1988-01-01 | Paper |
| Total domination in interval graphs revisited | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3790547 | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3798453 | 1988-01-01 | Paper |
| Matrix transposition in a magnetic bubble memory | 1988-01-01 | Paper |
| A linear space algorithm for the LCS problem | 1987-01-01 | Paper |
| On the minimum number of additions required to compute a quadratic form | 1983-01-01 | Paper |
