| Publication | Date of Publication | Type |
|---|
Efficient searchable symmetric encryption for join queries
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-25 | Paper |
| Sine series approximation of the mod function for bootstrapping of approximate HE | 2022-08-30 | Paper |
| Shorter QA-NIZK and SPS with tighter security | 2020-05-11 | Paper |
| Improved (almost) tightly-secure simulation-sound QA-NIZK with applications | 2018-12-20 | Paper |
| Smooth NIZK arguments | 2018-12-11 | Paper |
| Improved (almost) tightly-secure structure-preserving signatures | 2018-05-29 | Paper |
Shorter quasi-adaptive NIZK proofs for linear subspaces
Journal of Cryptology | 2018-02-15 | Paper |
Provably Good Codes for Hash Function Design
IEEE Transactions on Information Theory | 2017-08-08 | Paper |
Improved structure preserving signatures under standard bilinear assumptions
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Dual-system simulation-soundness with applications to UC-PAKE and more
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
Private database access with HE-over-ORAM architecture
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces
Advances in Cryptology – CRYPTO 2014 | 2014-08-07 | Paper |
Shorter quasi-adaptive NIZK proofs for linear subspaces
Advances in Cryptology - ASIACRYPT 2013 | 2013-12-10 | Paper |
Highly-Scalable Searchable Symmetric Encryption with Support for Boolean Queries
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Relatively-Sound NIZKs and Password-Based Key-Exchange
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Testing low-degree polynomials over prime fields
Random Structures & Algorithms | 2010-11-09 | Paper |
Almost optimal bounds for direct product threshold theorem
Theory of Cryptography | 2010-02-24 | Paper |
Encryption modes with almost free message integrity
Journal of Cryptology | 2009-06-08 | Paper |
Cryptanalysis of ISO/IEC 9796-1
Journal of Cryptology | 2008-04-16 | Paper |
Provably Good Codes for Hash Function Design
Selected Areas in Cryptography | 2007-11-29 | Paper |
Parallelizable Authentication Trees
Selected Areas in Cryptography | 2007-11-15 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2007-02-12 | Paper |
Selected Areas in Cryptography
Lecture Notes in Computer Science | 2005-12-27 | Paper |
| scientific article; zbMATH DE number 2089137 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1942441 (Why is no real title available?) | 2003-06-30 | Paper |
| scientific article; zbMATH DE number 1722692 (Why is no real title available?) | 2002-03-21 | Paper |
On model checking for the \(\mu\)-calculus and its fragments
Theoretical Computer Science | 2001-08-20 | Paper |
Secure distributed storage and retrieval
Theoretical Computer Science | 2000-08-21 | Paper |
| scientific article; zbMATH DE number 1302846 (Why is no real title available?) | 1999-12-12 | Paper |
The Complexity of Tree Automata and Logics of Programs
SIAM Journal on Computing | 1999-10-28 | Paper |
| scientific article; zbMATH DE number 1303120 (Why is no real title available?) | 1999-06-17 | Paper |
Determinization and memoryless winning strategies
Information and Computation | 1997-06-16 | Paper |
Finding extremal sets in less than quadratic time
Information Processing Letters | 1994-02-24 | Paper |
| scientific article; zbMATH DE number 4179361 (Why is no real title available?) | 1989-01-01 | Paper |
