| Publication | Date of Publication | Type |
|---|
A theoretical framework for the analysis of physical unclonable function interfaces and its relation to the random oracle model
Journal of Cryptology | 2023-08-22 | Paper |
scientific article; zbMATH DE number 7626722 (Why is no real title available?)
(available as arXiv preprint) | 2022-12-06 | Paper |
| scientific article; zbMATH DE number 7626722 (Why is no real title available?) | 2022-12-06 | Paper |
Finite-sum smooth optimization with SARAH
Computational Optimization and Applications | 2022-06-27 | Paper |
| Weak-unforgeable tags for secure supply chain management | 2021-03-17 | Paper |
A Unified Convergence Analysis for Shuffling-Type Gradient Methods
(available as arXiv preprint) | 2020-02-19 | Paper |
| New Convergence Aspects of Stochastic Gradient Algorithms | 2020-02-07 | Paper |
New Convergence Aspects of Stochastic Gradient Algorithms
(available as arXiv preprint) | 2020-02-07 | Paper |
Path ORAM
Journal of the ACM | 2018-12-06 | Paper |
More information theoretical inequalities to be used in secret sharing?
Information Processing Letters | 2016-05-26 | Paper |
Onion ORAM: a constant bandwidth blowup oblivious RAM
Theory of Cryptography | 2016-04-08 | Paper |
\texttt{FlipIt}: the game of ``stealthy takeover
Journal of Cryptology | 2013-11-15 | Paper |
Defending against the unknown enemy: applying FlipIt to system security
Lecture Notes in Computer Science | 2013-03-13 | Paper |
Practical security analysis of PUF-based two-player protocols
Cryptographic Hardware and Embedded Systems – CHES 2012 | 2012-11-13 | Paper |
Fully homomorphic encryption over the integers
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Improved constructions of secret sharing schemes by applying \((\lambda ,\omega )\)-decompositions
Information Processing Letters | 2010-01-29 | Paper |
Incremental multiset hash functions and their application to memory integrity checking
Lecture Notes in Computer Science | 2010-01-05 | Paper |
On Two Doubly Even Self-Dual Binary Codes of Length<tex>$160$</tex>and Minimum Weight<tex>$24$</tex>
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Simultaneous zero-tailing of parallel concatenated codes
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Capacity and Codes for Embedding Information in Gray-Scale Signals
IEEE Transactions on Information Theory | 2008-12-21 | Paper |
Practical Cryptography in High Dimensional Tori
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Speeding up exponentiation using an untrusted computational resource
Designs, Codes and Cryptography | 2006-05-29 | Paper |
Advances in Cryptology – CRYPTO 2004
Lecture Notes in Computer Science | 2005-08-23 | Paper |
| scientific article; zbMATH DE number 2086704 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2081152 (Why is no real title available?) | 2004-08-04 | Paper |
A practical protocol for advantage distillation and information reconciliation
Designs, Codes and Cryptography | 2003-09-07 | Paper |
| scientific article; zbMATH DE number 1928244 (Why is no real title available?) | 2003-06-15 | Paper |
A general decomposition construction for incomplete secret sharing schemes
Designs, Codes and Cryptography | 2001-09-18 | Paper |
Efficient encoding for a class of subspace subcodes
IEEE Transactions on Information Theory | 2000-09-07 | Paper |
A linear construction of secret sharing schemes
Designs, Codes and Cryptography | 1999-05-06 | Paper |
Unconditionally secure group authentication
Designs, Codes and Cryptography | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 994583 (Why is no real title available?) | 1999-05-05 | Paper |
| scientific article; zbMATH DE number 1088900 (Why is no real title available?) | 1997-12-14 | Paper |
| scientific article; zbMATH DE number 1095500 (Why is no real title available?) | 1997-12-09 | Paper |
On a special class of broadcast channels with confidential messages
IEEE Transactions on Information Theory | 1997-10-20 | Paper |
On the information rate of perfect secret sharing schemes
Designs, Codes and Cryptography | 1995-07-24 | Paper |
