| Publication | Date of Publication | Type |
|---|
Logarithmic-size (linkable) threshold ring signatures in the plain model
Public-Key Cryptography – PKC 2022 | 2023-08-10 | Paper |
Towards attribute-based credentials in the cloud
Cryptology and Network Security | 2023-08-02 | Paper |
Protean Signature Schemes
Cryptology and Network Security | 2023-06-28 | Paper |
| Fully collision-resistant chameleon-hashes from simpler and post-quantum assumptions | 2022-12-16 | Paper |
Efficient Zero-Knowledge Proofs for Commitments from Learning with Errors over Rings
Computer Security -- ESORICS 2015 | 2022-08-19 | Paper |
| Issuer-hiding attribute-based credentials | 2022-06-29 | Paper |
Breaking and fixing anonymous credentials for the cloud
Cryptology and Network Security | 2020-07-20 | Paper |
| iUC: flexible universal composability made simple | 2020-05-11 | Paper |
| Signer-anonymous designated-verifier redactable signatures for cloud-based data sharing | 2018-10-26 | Paper |
| Chameleon-hashes with dual long-term trapdoors and their applications | 2018-07-17 | Paper |
| Revisiting proxy re-encryption: forward secrecy, improved security, and applications | 2018-05-16 | Paper |
| Practical strongly invisible and strongly accountable sanitizable signatures | 2017-08-25 | Paper |
Chameleon-hashes with ephemeral trapdoors and applications to invisible sanitizable signatures
Lecture Notes in Computer Science | 2017-06-13 | Paper |
Universal composition with responsive environments
Advances in Cryptology – ASIACRYPT 2016 | 2017-01-06 | Paper |
A counterexample to the chain rule for conditional HILL entropy
Computational Complexity | 2016-10-28 | Paper |
Formal treatment of privacy-enhancing credential systems
Lecture Notes in Computer Science | 2016-05-19 | Paper |
Recovering lost device-bound credentials
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Better zero-knowledge proofs for lattice encryption and their application to group signatures
Lecture Notes in Computer Science | 2015-01-16 | Paper |
Learning with rounding, revisited. New reduction, properties and applications
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Commitments and efficient zero-knowledge proofs from learning parity with noise
Advances in Cryptology – ASIACRYPT 2012 | 2013-03-19 | Paper |
A counterexample to the chain rule for conditional HILL entropy. And what deniable encryption has to do with it
Theory of Cryptography | 2013-03-18 | Paper |
A framework for practical universally composable zero-knowledge protocols
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Automatic generation of \(\Sigma\)-protocols
Public Key Infrastructures, Services and Applications | 2011-02-04 | Paper |
Efficiency limitations for \(\Sigma \)-protocols for group homomorphisms
Theory of Cryptography | 2010-02-24 | Paper |
