| Publication | Date of Publication | Type |
|---|
Registered attribute-based encryption
Advances in Cryptology – EUROCRYPT 2023 | 2023-12-12 | Paper |
Chosen ciphertext security from injective trapdoor functions
| 2022-11-09 | Paper |
A performance evaluation of pairing-based broadcast encryption systems
| 2022-11-09 | Paper |
Signature schemes with randomized verification
| 2022-07-01 | Paper |
New methods and abstractions for RSA-based forward secure signatures
| 2021-02-23 | Paper |
Synchronized aggregate signatures from the RSA assumption
| 2018-07-09 | Paper |
A generic approach to constructing and proving verifiable random functions
| 2018-01-19 | Paper |
Adaptively secure puncturable pseudorandom functions in the standard model
Advances in Cryptology -- ASIACRYPT 2015 | 2016-06-10 | Paper |
New circular security counterexamples from decision linear and learning with errors
Advances in Cryptology – ASIACRYPT 2015 | 2016-03-23 | Paper |
Universal signature aggregators
Advances in Cryptology - EUROCRYPT 2015 | 2015-09-30 | Paper |
Computing on authenticated data
Journal of Cryptology | 2015-05-12 | Paper |
Replacing a random oracle: full domain hash from indistinguishability obfuscation
Advances in Cryptology – EUROCRYPT 2014 | 2014-05-27 | Paper |
Online/Offline Attribute-Based Encryption
Public-Key Cryptography – PKC 2014 | 2014-03-25 | Paper |
Full domain hash from (leveled) multilinear maps and identity-based aggregate signatures
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Attribute-based encryption with fast decryption
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Batch verification of short signatures
Journal of Cryptology | 2013-01-04 | Paper |
New definitions and separations for circular security
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Detecting dangerous queries: a new approach for chosen ciphertext security
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
Computing on Authenticated Data
Theory of Cryptography | 2012-06-15 | Paper |
Securely obfuscating re-encryption
Journal of Cryptology | 2012-01-13 | Paper |
Tetris is Hard, Even to Approximate
Lecture Notes in Computer Science | 2011-03-18 | Paper |
Constructing verifiable random functions with large input spaces
Advances in Cryptology – EUROCRYPT 2010 | 2010-06-01 | Paper |
Short and Stateless Signatures from the RSA Assumption
Advances in Cryptology - CRYPTO 2009 | 2009-10-20 | Paper |
Realizing Hash-and-Sign Signatures under Standard Assumptions
Advances in Cryptology - EUROCRYPT 2009 | 2009-05-12 | Paper |
Key-Private Proxy Re-encryption
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Balancing Accountability and Privacy Using E-Cash (Extended Abstract)
Lecture Notes in Computer Science | 2008-11-27 | Paper |
Lightweight Email Signatures (Extended Abstract)
Lecture Notes in Computer Science | 2008-11-27 | Paper |
On Tweaking Luby-Rackoff Blockciphers
Advances in Cryptology – ASIACRYPT 2007 | 2008-05-15 | Paper |
Compact E-Cash
Lecture Notes in Computer Science | 2008-05-06 | Paper |
Batch Verification of Short Signatures
Advances in Cryptology - EUROCRYPT 2007 | 2007-11-29 | Paper |
Securely Obfuscating Re-encryption
Theory of Cryptography | 2007-08-30 | Paper |
Theory of Cryptography
Lecture Notes in Computer Science | 2005-12-07 | Paper |
TETRIS IS HARD, EVEN TO APPROXIMATE
International Journal of Computational Geometry & Applications | 2004-09-29 | Paper |
