| Publication | Date of Publication | Type |
|---|
Advancing scalability in decentralized storage: a novel approach to proof-of-replication via polynomial evaluation
| 2024-12-04 | Paper |
Verifiable capacity-bound functions: a new primitive from Kolmogorov complexity. (Revisiting space-based security in the adaptive setting)
Lecture Notes in Computer Science | 2023-11-16 | Paper |
Accountable storage
| 2022-07-01 | Paper |
Sanitizable signatures
Computer Security – ESORICS 2005 | 2022-03-09 | Paper |
Match me if you can: matchmaking encryption and its applications
Journal of Cryptology | 2021-07-02 | Paper |
Immunization against complete subversion without random oracles
Theoretical Computer Science | 2021-02-15 | Paper |
Subversion-resilient signatures: definitions, constructions and applications
Theoretical Computer Science | 2020-04-21 | Paper |
Match me if you can: matchmaking encryption and its applications
Advances in Cryptology – CRYPTO 2019 | 2020-03-09 | Paper |
Public immunization against complete subversion without random oracles
| 2020-01-30 | Paper |
PassGAN: a deep learning approach for password guessing
| 2020-01-30 | Paper |
A family of FDH signature schemes based on the quadratic residuosity assumption
| 2019-03-29 | Paper |
Secure outsourcing of cryptographic circuits manufacturing
| 2018-11-07 | Paper |
Nearly optimal verifiable data streaming
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Leakage-resilient identification schemes from zero-knowledge proofs of storage
Cryptography and Coding | 2016-01-12 | Paper |
Proofs of space: when space is of the essence
Lecture Notes in Computer Science | 2014-10-14 | 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 |
High-entropy visual identification for touch screen devices
Information Security Practice and Experience | 2012-06-29 | Paper |
Quasi-Efficient Revocation of Group Signatures
Financial Cryptography | 2011-04-20 | Paper |
(If) size matters: size-hiding private set intersection
Public Key Cryptography – PKC 2011 | 2011-03-15 | Paper |
Efficient group signatures without trapdoors
Lecture Notes in Computer Science | 2010-01-05 | Paper |
Proofs of storage from homomorphic identification protocols
Advances in Cryptology – ASIACRYPT 2009 | 2009-12-15 | Paper |
Remarks on ``Analysis of one popular group signature scheme in Asiacrypt 2006
International Journal of Applied Cryptography | 2009-10-12 | Paper |
Key-Private Proxy Re-encryption
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Universally Anonymous IBE Based on the Quadratic Residuosity Assumption
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Verifiable encryption of digital signatures and applications
ACM Transactions on Information and System Security | 2008-12-21 | Paper |
Cryptology and Network Security
Lecture Notes in Computer Science | 2006-11-14 | 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 |
Financial Cryptography
Lecture Notes in Computer Science | 2005-06-13 | Paper |
scientific article; zbMATH DE number 2102766 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2102683 (Why is no real title available?)
| 2004-09-24 | Paper |
scientific article; zbMATH DE number 2079928 (Why is no real title available?)
| 2004-08-03 | Paper |
scientific article; zbMATH DE number 1952899 (Why is no real title available?)
| 2003-07-24 | Paper |
scientific article; zbMATH DE number 1759783 (Why is no real title available?)
| 2002-10-07 | Paper |
Extended capabilities for visual cryptography
Theoretical Computer Science | 2000-12-12 | Paper |
scientific article; zbMATH DE number 1408383 (Why is no real title available?)
| 2000-05-28 | Paper |
scientific article; zbMATH DE number 1305483 (Why is no real title available?)
| 1999-09-15 | Paper |
