| Publication | Date of Publication | Type |
|---|
| Communication efficient Zero-knowledge Proofs of knowledge | 2022-08-18 | Paper |
| Probabilistic secret sharing | 2021-08-04 | Paper |
| Secret sharing schemes for infinite sets of participants: a new design technique | 2021-02-15 | Paper |
| Supporting dynamic updates in storage clouds with the Akl-Taylor scheme | 2020-02-06 | Paper |
| One-message statistical Zero-Knowledge Proofs and space-bounded verifier | 2019-12-04 | Paper |
| Randomness in distribution protocols | 2019-04-29 | Paper |
| On the number of random bits in totally private computation | 2019-01-10 | Paper |
| Randomness-efficient non-interactive zero knowledge | 2018-07-04 | Paper |
| Security of public-key cryptosystems based on Chebyshev polynomials | 2017-11-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271427 | 2017-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271430 | 2017-07-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5271434 | 2017-07-11 | Paper |
| On the Relations Between Security Notions in Hierarchical Key Assignment Schemes for Dynamic Structures | 2016-09-02 | Paper |
| How to share a function securely | 2016-09-01 | Paper |
| The graph clustering problem has a perfect zero-knowledge interactive proof | 2016-06-16 | Paper |
| On secret set schemes | 2016-06-16 | Paper |
| Visual cryptography for grey level images | 2016-06-16 | Paper |
| On secret sharing schemes | 2016-06-09 | Paper |
| Lower bounds for robust secret sharing schemes | 2016-05-26 | Paper |
| Measure-Independent Characterization of Contrast Optimal Visual Cryptography Schemes | 2015-09-30 | Paper |
| Modeling energy-efficient secure communications in multi-mode wireless mobile devices | 2015-08-31 | Paper |
| Anonymous protocols: notions and equivalence | 2015-05-22 | Paper |
| Color visual cryptography schemes for black and white secret images | 2014-01-13 | Paper |
| A note on time-bound hierarchical key assignment schemes | 2013-03-21 | Paper |
| Provably-secure time-bound hierarchical key assignment schemes | 2012-07-03 | Paper |
| Efficient provably-secure hierarchical key assignment schemes | 2011-10-10 | Paper |
| Using Colors to Improve Visual Cryptography for Black and White Images | 2011-05-19 | Paper |
| Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation | 2009-12-03 | Paper |
| Variations on a theme by Akl and Taylor: security and tradeoffs | 2009-12-01 | Paper |
| Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants | 2009-10-16 | Paper |
| Cryptographic key assignment schemes for any access control policy | 2009-08-27 | Paper |
| Ideal contrast visual cryptography schemes with reversing | 2009-08-27 | Paper |
| On Monotone Formula Composition of Perfect Zero-Knowledge Languages | 2009-08-20 | Paper |
| Colored visual cryptography without color darkening | 2009-06-22 | Paper |
| On Self-Healing Key Distribution Schemes | 2008-12-21 | Paper |
| Cheating Immune (2,n)-Threshold Visual Secret Sharing | 2008-11-27 | Paper |
| New constructions for provably-secure time-bound hierarchical key assignment schemes | 2008-11-18 | Paper |
| Efficient Provably-Secure Hierarchical Key Assignment Schemes | 2008-09-17 | Paper |
| Weaknesses in a Recent Ultra-Lightweight RFID Authentication Protocol | 2008-06-13 | Paper |
| An attack on a payment scheme | 2008-03-12 | Paper |
| On unconditionally secure distributed oblivious transfer | 2007-08-20 | Paper |
| Coding and Cryptography | 2007-05-02 | Paper |
| Visual cryptography schemes with optimal pixel expansion | 2007-01-09 | Paper |
| Security in Communication Networks | 2006-10-10 | Paper |
| Visual cryptography for general access structures | 2006-10-10 | Paper |
| Enforcing the security of a time-bound hierarchical key assignment scheme | 2006-05-16 | Paper |
| Unconditionally secure key assignment schemes | 2006-04-28 | Paper |
| Automata, Languages and Programming | 2005-08-24 | Paper |
| Mathematical Foundations of Computer Science 2004 | 2005-08-22 | Paper |
| Optimal colored threshold visual cryptography schemes | 2005-08-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818854 | 2004-09-24 | Paper |
| Design of self-healing key distribution schemes | 2004-08-16 | Paper |
| Anonymous membership broadcast schemes | 2004-08-16 | Paper |
| Randomness in secret sharing and visual cryptography schemes | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4448387 | 2004-02-18 | Paper |
| Contrast Optimal Threshold Visual Cryptography Schemes | 2004-01-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4440437 | 2003-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4413869 | 2003-07-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4783745 | 2002-12-08 | Paper |
| Bounds on entropy in a guessing game | 2002-08-04 | Paper |
| Probability of shares in secret sharing schemes | 2002-07-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501568 | 2002-05-14 | Paper |
| Randomness complexity of private computation | 2002-04-21 | Paper |
| Improved schemes for visual cryptography | 2002-04-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2754163 | 2001-12-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2708623 | 2001-07-17 | Paper |
| A t-private k-database information retrieval scheme | 2001-01-01 | Paper |
| Extended capabilities for visual cryptography | 2000-12-12 | Paper |
| On the contrast in visual cryptography schemes | 2000-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954414 | 2000-06-07 | Paper |
| On a fallacious bound for authentication codes | 2000-05-22 | Paper |
| On the Data Expansion of the Huffman Compression Algorithm | 2000-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4940693 | 2000-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938630 | 2000-02-23 | Paper |
| A lower bound on the encoding length in lossy transmission | 2000-01-05 | Paper |
| Multiple ramp schemes | 1999-11-21 | Paper |
| On lower bounds for the redundancy of optimal codes | 1999-06-27 | Paper |
| A new bound for the data expansion of Huffman codes | 1999-05-05 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4230367 | 1999-04-22 | Paper |
| Perfectly secure key distribution for dynamic conferences | 1999-03-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341789 | 1998-01-04 | Paper |
| Tight bounds on the information rate of secret sharing schemes | 1997-12-18 | Paper |
| Randomness in distribution protocols | 1997-10-13 | Paper |
| On the redundancy achieved by Huffman codes | 1997-09-04 | Paper |
| Catastrophic faults in reconfigurable systolic linear arrays | 1997-08-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341734 | 1997-07-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4341737 | 1997-07-20 | Paper |
| On the information rate of secret sharing schemes | 1997-02-28 | Paper |
| Fully dynamic secret sharing schemes | 1997-02-27 | Paper |
| New lower bounds on the cost of binary search trees | 1997-02-27 | Paper |
| The power of preprocessing in zero-knowledge proofs of knowledge | 1997-01-14 | Paper |
| New bounds on the information rate of secret sharing schemes | 1995-12-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4858451 | 1995-12-13 | Paper |
| Zero-knowledge arguments and public-key cryptography | 1995-11-05 | Paper |
| Graph decompositions and secret sharing schemes | 1995-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318716 | 1995-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318691 | 1995-03-30 | Paper |
| Binary prefix codes ending in a "1" | 1995-03-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4281571 | 1994-10-04 | Paper |
| The knowledge complexity of quadratic residuosity languages | 1994-09-25 | Paper |
| Tight Upper and Lower Bounds on the Path Length of Binary Trees | 1994-03-27 | Paper |
| Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems | 1994-03-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4279656 | 1994-02-22 | Paper |
| On the size of shares for secret sharing schemes | 1994-01-03 | Paper |
| On binary search trees | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035694 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4035710 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036858 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4036897 | 1993-05-18 | Paper |
| On the construction of statistically synchronizable codes | 1992-06-28 | Paper |
| On the redundancy of optimal codes with limited word length | 1992-06-28 | Paper |
| Noninteractive Zero-Knowledge | 1992-06-27 | Paper |
| A note on D-ary Huffman codes | 1991-01-01 | Paper |
| New bounds on the redundancy of Huffman codes | 1991-01-01 | Paper |
| Removing Interaction from Zero-Knowledge Proofs | 1990-01-01 | Paper |
| Tight upper bounds on the redundancy of Huffman codes | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3789104 | 1988-01-01 | Paper |
| Bounds on the entropy series | 1988-01-01 | Paper |
| Regular universal codeword sets (Corresp.) | 1986-01-01 | Paper |
