| Publication | Date of Publication | Type |
|---|
| MUSEN: aggregatable key-evolving verifiable random functions and applications | 2025-01-10 | Paper |
CRAFT: \underline{C}omposable \underline{R}andomness beacons and output-independent \underline{A}bort MPC \underline{F}rom \underline{T}ime
Lecture Notes in Computer Science | 2023-11-24 | Paper |
Post-quantum verifiable random function from symmetric primitives in PoS blockchain
Computer Security – ESORICS 2022 | 2023-07-21 | Paper |
(Public) verifiability for composable protocols without adaptivity or zero-knowledge
Provable and Practical Security | 2023-07-21 | Paper |
| Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model | 2023-03-22 | Paper |
| TARDIS: a foundation of time-lock puzzles in UC | 2021-12-08 | Paper |
| Insured MPC: efficient secure computation with financial penalties | 2021-02-08 | Paper |
On the Commitment Capacity of Unfair Noisy Channels
IEEE Transactions on Information Theory | 2020-09-29 | Paper |
| Efficient UC commitment extension with homomorphism for free (and applications) | 2020-05-05 | Paper |
On the impossibility of structure-preserving deterministic primitives
Journal of Cryptology | 2019-01-29 | Paper |
| 21 -- bringing down the complexity: fast composable protocols for card games without secret state | 2018-09-26 | Paper |
Commitment and Oblivious Transfer in the Bounded Storage Model With Errors
IEEE Transactions on Information Theory | 2018-09-19 | Paper |
On the Oblivious Transfer Capacity of Generalized Erasure Channels Against Malicious Adversaries: The Case of Low Erasure Probability
IEEE Transactions on Information Theory | 2018-06-27 | Paper |
Achieving Oblivious Transfer Capacity of Generalized Erasure Channels in the Malicious Model
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
A CCA2 Secure Variant of the McEliece Cryptosystem
IEEE Transactions on Information Theory | 2017-06-08 | Paper |
Efficient unconditionally secure comparison and privacy preserving machine learning classification protocols
Provable Security | 2016-01-27 | Paper |
Weakening the isolation assumption of tamper-proof hardware tokens
Lecture Notes in Computer Science | 2015-09-24 | Paper |
Digital signatures from strong RSA without prime generation
Lecture Notes in Computer Science | 2015-08-27 | Paper |
How secure is deterministic encryption?
Lecture Notes in Computer Science | 2015-08-27 | Paper |
Universally composable oblivious transfer based on a variant of LPN
Cryptology and Network Security | 2015-02-10 | Paper |
On the impossibility of structure-preserving deterministic primitives
Theory of Cryptography | 2014-02-18 | Paper |
Standard security does not imply security against selective-opening
Advances in Cryptology – EUROCRYPT 2012 | 2012-06-29 | Paper |
A CCA2 Secure Public Key Encryption Scheme Based on the McEliece Assumptions in the Standard Model
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
Oblivious Transfer Based on the McEliece Assumptions
Lecture Notes in Computer Science | 2009-01-09 | Paper |
