| Publication | Date of Publication | Type |
|---|
Bounds and algorithms for alphabetic codes and binary search trees
IEEE Transactions on Information Theory | 2025-01-23 | Paper |
| Private computations on set intersection | 2024-10-02 | Paper |
Communication efficient zero-knowledge proofs of knowledge (with applications to electronic cash)
STACS 92 | 2022-08-18 | Paper |
| Probabilistic secret sharing | 2021-08-04 | Paper |
Secret sharing schemes for infinite sets of participants: a new design technique
Theoretical Computer Science | 2021-02-15 | Paper |
Supporting dynamic updates in storage clouds with the Akl-Taylor scheme
Information Sciences | 2020-02-06 | Paper |
One-message statistical Zero-Knowledge Proofs and space-bounded verifier
Automata, Languages and Programming | 2019-12-04 | Paper |
Randomness in distribution protocols
Automata, Languages and Programming | 2019-04-29 | Paper |
On the number of random bits in totally private computation
Automata, Languages and Programming | 2019-01-10 | Paper |
Randomness-efficient non-interactive zero knowledge
Automata, Languages and Programming | 2018-07-04 | Paper |
Security of public-key cryptosystems based on Chebyshev polynomials
IEEE Transactions on Circuits and Systems I: Regular Papers | 2017-11-20 | Paper |
| scientific article; zbMATH DE number 6741942 (Why is no real title available?) | 2017-07-11 | Paper |
| scientific article; zbMATH DE number 6741945 (Why is no real title available?) | 2017-07-11 | Paper |
| scientific article; zbMATH DE number 6741949 (Why is no real title available?) | 2017-07-11 | Paper |
On the relations between security notions in hierarchical key assignment schemes for dynamic structures
Information Security and Privacy | 2016-09-02 | Paper |
How to share a function securely
Proceedings of the twenty-sixth annual ACM symposium on Theory of computing - STOC '94 | 2016-09-01 | Paper |
The graph clustering problem has a perfect zero-knowledge interactive proof
Information Processing Letters | 2016-06-16 | Paper |
On secret set schemes
Information Processing Letters | 2016-06-16 | Paper |
Visual cryptography for grey level images
Information Processing Letters | 2016-06-16 | Paper |
On secret sharing schemes
Information Processing Letters | 2016-06-09 | Paper |
Lower bounds for robust secret sharing schemes
Information Processing Letters | 2016-05-26 | Paper |
Measure-independent characterization of contrast optimal visual cryptography schemes
Lecture Notes in Computer Science | 2015-09-30 | Paper |
Modeling energy-efficient secure communications in multi-mode wireless mobile devices
Journal of Computer and System Sciences | 2015-08-31 | Paper |
Anonymous protocols: notions and equivalence
Theoretical Computer Science | 2015-05-22 | Paper |
Color visual cryptography schemes for black and white secret images
Theoretical Computer Science | 2014-01-13 | Paper |
A note on time-bound hierarchical key assignment schemes
Information Processing Letters | 2013-03-21 | Paper |
Provably-secure time-bound hierarchical key assignment schemes
Journal of Cryptology | 2012-07-03 | Paper |
Efficient provably-secure hierarchical key assignment schemes
Theoretical Computer Science | 2011-10-10 | Paper |
Using colors to improve visual cryptography for black and white images
Lecture Notes in Computer Science | 2011-05-19 | Paper |
Optimising SD and LSD in Presence of Non-uniform Probabilities of Revocation
Lecture Notes in Computer Science | 2009-12-03 | Paper |
Variations on a theme by Akl and Taylor: security and tradeoffs
Theoretical Computer Science | 2009-12-01 | Paper |
Security and Tradeoffs of the Akl-Taylor Scheme and Its Variants
Mathematical Foundations of Computer Science 2009 | 2009-10-16 | Paper |
Cryptographic key assignment schemes for any access control policy
Information Processing Letters | 2009-08-27 | Paper |
Ideal contrast visual cryptography schemes with reversing
Information Processing Letters | 2009-08-27 | Paper |
On Monotone Formula Composition of Perfect Zero-Knowledge Languages
SIAM Journal on Computing | 2009-08-20 | Paper |
Colored visual cryptography without color darkening
Theoretical Computer Science | 2009-06-22 | Paper |
On Self-Healing Key Distribution Schemes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Cheating Immune (2,n)-Threshold Visual Secret Sharing
Lecture Notes in Computer Science | 2008-11-27 | Paper |
New constructions for provably-secure time-bound hierarchical key assignment schemes
Theoretical Computer Science | 2008-11-18 | Paper |
Efficient Provably-Secure Hierarchical Key Assignment Schemes
Mathematical Foundations of Computer Science 2007 | 2008-09-17 | Paper |
Weaknesses in a Recent Ultra-Lightweight RFID Authentication Protocol
Progress in Cryptology – AFRICACRYPT 2008 | 2008-06-13 | Paper |
An attack on a payment scheme
Information Sciences | 2008-03-12 | Paper |
On unconditionally secure distributed oblivious transfer
Journal of Cryptology | 2007-08-20 | Paper |
Coding and Cryptography
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Visual cryptography schemes with optimal pixel expansion
Theoretical Computer Science | 2007-01-09 | Paper |
Visual cryptography for general access structures
Information and Computation | 2006-10-10 | Paper |
Security in Communication Networks
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Enforcing the security of a time-bound hierarchical key assignment scheme
Information Sciences | 2006-05-16 | Paper |
Unconditionally secure key assignment schemes
Discrete Applied Mathematics | 2006-04-28 | Paper |
Automata, Languages and Programming
Lecture Notes in Computer Science | 2005-08-24 | Paper |
Mathematical Foundations of Computer Science 2004
Lecture Notes in Computer Science | 2005-08-22 | Paper |
Optimal colored threshold visual cryptography schemes
Designs, Codes and Cryptography | 2005-08-17 | Paper |
| scientific article; zbMATH DE number 2102766 (Why is no real title available?) | 2004-09-24 | Paper |
Design of self-healing key distribution schemes
Designs, Codes and Cryptography | 2004-08-16 | Paper |
Anonymous membership broadcast schemes
Designs, Codes and Cryptography | 2004-08-16 | Paper |
Randomness in secret sharing and visual cryptography schemes
Theoretical Computer Science | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2044524 (Why is no real title available?) | 2004-02-18 | Paper |
Contrast Optimal Threshold Visual Cryptography Schemes
SIAM Journal on Discrete Mathematics | 2004-01-08 | Paper |
| scientific article; zbMATH DE number 2019634 (Why is no real title available?) | 2003-12-17 | Paper |
| scientific article; zbMATH DE number 1951618 (Why is no real title available?) | 2003-07-21 | Paper |
| scientific article; zbMATH DE number 1842511 (Why is no real title available?) | 2002-12-08 | Paper |
Bounds on entropy in a guessing game
IEEE Transactions on Information Theory | 2002-08-04 | Paper |
Probability of shares in secret sharing schemes
Information Processing Letters | 2002-07-25 | Paper |
| scientific article; zbMATH DE number 1500549 (Why is no real title available?) | 2002-05-14 | Paper |
Randomness complexity of private computation
Computational Complexity | 2002-04-21 | Paper |
Improved schemes for visual cryptography
Designs, Codes and Cryptography | 2002-04-15 | Paper |
| scientific article; zbMATH DE number 1670843 (Why is no real title available?) | 2001-12-06 | Paper |
| scientific article; zbMATH DE number 1588476 (Why is no real title available?) | 2001-07-17 | Paper |
A t-private k-database information retrieval scheme
International Journal of Information Security | 2001-01-01 | Paper |
Extended capabilities for visual cryptography
Theoretical Computer Science | 2000-12-12 | Paper |
On the contrast in visual cryptography schemes
Journal of Cryptology | 2000-09-24 | Paper |
| scientific article; zbMATH DE number 1456816 (Why is no real title available?) | 2000-06-07 | Paper |
On a fallacious bound for authentication codes
Journal of Cryptology | 2000-05-22 | Paper |
On the Data Expansion of the Huffman Compression Algorithm
The Computer Journal | 2000-03-19 | Paper |
| scientific article; zbMATH DE number 1406777 (Why is no real title available?) | 2000-03-01 | Paper |
| scientific article; zbMATH DE number 1405650 (Why is no real title available?) | 2000-02-23 | Paper |
A lower bound on the encoding length in lossy transmission
Information Sciences | 2000-01-05 | Paper |
Multiple ramp schemes
IEEE Transactions on Information Theory | 1999-11-21 | Paper |
On lower bounds for the redundancy of optimal codes
Designs, Codes and Cryptography | 1999-06-27 | Paper |
A new bound for the data expansion of Huffman codes
IEEE Transactions on Information Theory | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 1256680 (Why is no real title available?) | 1999-04-22 | Paper |
Perfectly secure key distribution for dynamic conferences
Information and Computation | 1999-03-30 | Paper |
| scientific article; zbMATH DE number 1024095 (Why is no real title available?) | 1998-01-04 | Paper |
Tight bounds on the information rate of secret sharing schemes
Designs, Codes and Cryptography | 1997-12-18 | Paper |
Randomness in distribution protocols
Information and Computation | 1997-10-13 | Paper |
On the redundancy achieved by Huffman codes
Information Sciences | 1997-09-04 | Paper |
Catastrophic faults in reconfigurable systolic linear arrays
Discrete Applied Mathematics | 1997-08-10 | Paper |
| scientific article; zbMATH DE number 1024046 (Why is no real title available?) | 1997-07-20 | Paper |
| scientific article; zbMATH DE number 1024049 (Why is no real title available?) | 1997-07-20 | Paper |
On the information rate of secret sharing schemes
Theoretical Computer Science | 1997-02-28 | Paper |
Fully dynamic secret sharing schemes
Theoretical Computer Science | 1997-02-27 | Paper |
New lower bounds on the cost of binary search trees
Theoretical Computer Science | 1997-02-27 | Paper |
The power of preprocessing in zero-knowledge proofs of knowledge
Journal of Cryptology | 1997-01-14 | Paper |
New bounds on the information rate of secret sharing schemes
IEEE Transactions on Information Theory | 1995-12-17 | Paper |
| scientific article; zbMATH DE number 826065 (Why is no real title available?) | 1995-12-13 | Paper |
Zero-knowledge arguments and public-key cryptography
Information and Computation | 1995-11-05 | Paper |
| scientific article; zbMATH DE number 708825 (Why is no real title available?) | 1995-07-16 | Paper |
Graph decompositions and secret sharing schemes
Journal of Cryptology | 1995-07-16 | Paper |
| scientific article; zbMATH DE number 708803 (Why is no real title available?) | 1995-03-30 | Paper |
Binary prefix codes ending in a "1"
IEEE Transactions on Information Theory | 1995-03-01 | Paper |
| scientific article; zbMATH DE number 512874 (Why is no real title available?) | 1994-10-04 | Paper |
The knowledge complexity of quadratic residuosity languages
Theoretical Computer Science | 1994-09-25 | Paper |
Tight Upper and Lower Bounds on the Path Length of Binary Trees
SIAM Journal on Computing | 1994-03-27 | Paper |
Cryptographic Applications of the Non-Interactive Metaproof and Many-prover Systems
Advances in Cryptology - CRYPTO '90. A conference on the theory and application of Cryptography, Univ. of California, Santa Barbara, USA, August 11--15, 1990. Proceedings | 1994-03-07 | Paper |
| scientific article; zbMATH DE number 503323 (Why is no real title available?) | 1994-02-22 | Paper |
On the size of shares for secret sharing schemes
Journal of Cryptology | 1994-01-03 | Paper |
On binary search trees
Information Processing Letters | 1993-06-29 | Paper |
| scientific article; zbMATH DE number 176543 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 176528 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177052 (Why is no real title available?) | 1993-05-18 | Paper |
| scientific article; zbMATH DE number 177022 (Why is no real title available?) | 1993-05-18 | Paper |
On the construction of statistically synchronizable codes
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
On the redundancy of optimal codes with limited word length
IEEE Transactions on Information Theory | 1992-06-28 | Paper |
Noninteractive Zero-Knowledge
SIAM Journal on Computing | 1992-06-27 | Paper |
New bounds on the redundancy of Huffman codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
A note on D-ary Huffman codes
IEEE Transactions on Information Theory | 1991-01-01 | Paper |
Removing Interaction from Zero-Knowledge Proofs
Sequences | 1990-01-01 | Paper |
Tight upper bounds on the redundancy of Huffman codes
IEEE Transactions on Information Theory | 1989-01-01 | Paper |
| scientific article; zbMATH DE number 4053065 (Why is no real title available?) | 1988-01-01 | Paper |
Bounds on the entropy series
IEEE Transactions on Information Theory | 1988-01-01 | Paper |
Regular universal codeword sets (Corresp.)
IEEE Transactions on Information Theory | 1986-01-01 | Paper |
