| Publication | Date of Publication | Type |
|---|
| Practical cryptanalysis of pseudorandom correlation generators based on quasi-abelian syndrome decoding | 2026-04-23 | Paper |
Threshold Niederreiter: chosen-ciphertext security and improved distributed decoding
Designs, Codes and Cryptography | 2026-03-16 | Paper |
| Fast secure computations on shared polynomials and applications to private set operations | 2026-02-03 | Paper |
Compact zero-knowledge arguments for Blum integers
Theoretical Computer Science | 2025-04-07 | Paper |
| Cryptanalysis of a generalized subset-sum pseudorandom generator | 2024-12-03 | Paper |
| Quantum security of subset cover problems | 2024-11-22 | Paper |
| Commitments with efficient zero-knowledge arguments from subset sum problems | 2024-06-05 | Paper |
| Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head} | 2024-06-05 | Paper |
Zero-knowledge protocols for the subset sum problem from MPC-in-the-head with rejection
Advances in Cryptology – ASIACRYPT 2022 | 2023-08-16 | Paper |
Dynamic random probing expansion with quasi linear asymptotic complexity
Lecture Notes in Computer Science | 2023-05-12 | Paper |
| Succinct Diophantine-satisfiability arguments | 2023-03-29 | Paper |
| Public-key generation with verifiable randomness | 2023-03-21 | Paper |
Secure storage -- confidentiality and authentication
Computer Science Review | 2022-09-16 | Paper |
| Reusing nonces in Schnorr signatures (and keeping it secure...) | 2022-08-25 | Paper |
| The key-dependent message security of key-alternating Feistel ciphers | 2021-12-20 | Paper |
Hardware security without secure hardware: how to decrypt with a password and a server
Theoretical Computer Science | 2021-11-18 | Paper |
Lower and upper bounds on the randomness complexity of private computations of AND
SIAM Journal on Discrete Mathematics | 2021-03-30 | Paper |
Privately outsourcing exponentiation to a single server: cryptanalysis and optimal constructions
Algorithmica | 2021-02-01 | Paper |
Speeding-up verification of digital signatures
Journal of Computer and System Sciences | 2021-01-22 | Paper |
Generalized polynomial decomposition for S-boxes with application to side-channel countermeasures
Lecture Notes in Computer Science | 2020-06-24 | Paper |
Inferring sequences produced by elliptic curve generators using Coppersmith's methods
Theoretical Computer Science | 2020-05-26 | Paper |
| Lower and upper bounds on the randomness complexity of private computations of AND | 2020-04-30 | Paper |
| Analysis and improvement of an authentication scheme in incremental cryptography | 2019-02-20 | Paper |
Polynomial interpolation of the generalized Diffie-Hellman and Naor-Reingold functions
Designs, Codes and Cryptography | 2019-01-11 | Paper |
| Lattice attacks on pairing-based signatures | 2018-04-20 | Paper |
| Lattice attacks against elliptic-curve signatures with blinded scalar multiplication | 2018-02-16 | Paper |
| Practical key recovery for discrete-logarithm based authentication schemes from random nonce bits | 2018-02-14 | Paper |
| Private multiplication over finite fields | 2017-10-27 | Paper |
Unidirectional Chosen-Ciphertext Secure Proxy Re-Encryption
IEEE Transactions on Information Theory | 2017-07-27 | Paper |
Polynomial interpolation of the Naor-Reingold pseudo-random function
Applicable Algebra in Engineering, Communication and Computing | 2017-07-19 | Paper |
Towards Practical Black-Box Accountable Authority IBE: Weak Black-Box Traceability With Short Ciphertexts and Private Keys
IEEE Transactions on Information Theory | 2017-07-12 | Paper |
Distribution and polynomial interpolation of the Dodis-Yampolskiy pseudo-random function
Arithmetic of Finite Fields | 2017-06-13 | Paper |
Full disk encryption: bridging theory and practice
Topics in Cryptology – CT-RSA 2017 | 2017-04-12 | Paper |
Randomness complexity of private circuits for multiplication
Advances in Cryptology – EUROCRYPT 2016 | 2016-07-15 | Paper |
Comment on ``A strong provably secure IBE scheme without bilinear map'' by M. Zheng, Y. Xiang and H. Zhou
Journal of Computer and System Sciences | 2016-04-18 | Paper |
Easing Coppersmith methods using analytic combinatorics: applications to public-key cryptography with weak pseudorandomness
Public-Key Cryptography – PKC 2016 | 2016-04-13 | Paper |
Mitigating server breaches in password-based authentication: secure and efficient solutions
Topics in Cryptology - CT-RSA 2016 | 2016-04-08 | Paper |
Robust pseudo-random number generators with input secure against side-channel attacks
Applied Cryptography and Network Security | 2016-03-10 | Paper |
Non-Interactive Zero-Knowledge Proofs of Non-Membership
Lecture Notes in Computer Science | 2016-03-02 | Paper |
Analysis and improvement of Lindell's UC-secure commitment schemes
Applied Cryptography and Network Security | 2014-01-24 | Paper |
New techniques for SPHFs and efficient one-round PAKE protocols
Advances in Cryptology – CRYPTO 2013 | 2013-09-02 | Paper |
Time/memory/data tradeoffs for variants of the RSA problem
Lecture Notes in Computer Science | 2013-06-11 | Paper |
Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
Public-Key Cryptography – PKC 2013 | 2013-04-19 | Paper |
Genus 2 hyperelliptic curve families with explicit Jacobian order evaluation and pairing-friendly constructions
Pairing-Based Cryptography – Pairing 2012 | 2013-04-04 | Paper |
Enumeration formula for \((2,n)\)-cubes in discrete planes
Discrete Applied Mathematics | 2012-10-26 | Paper |
Compact Round-Optimal Partially-Blind Signatures
Lecture Notes in Computer Science | 2012-09-25 | Paper |
Inferring sequences produced by nonlinear pseudorandom number generators using Coppersmith's methods
Public Key Cryptography – PKC 2012 | 2012-07-20 | Paper |
Round-optimal privacy-preserving protocols with smooth projective hash functions
Theory of Cryptography | 2012-06-15 | Paper |
Block-wise P-signatures and non-interactive anonymous credentials with efficient attributes
Cryptography and Coding | 2011-12-16 | Paper |
Lossy encryption: Constructions from general assumptions and efficient selective opening chosen ciphertext security
Lecture Notes in Computer Science | 2011-12-02 | Paper |
Efficient and secure generalized pattern matching via Fast Fourier Transform
Lecture Notes in Computer Science | 2011-06-29 | Paper |
Signatures on randomizable ciphertexts
Public Key Cryptography – PKC 2011 | 2011-03-15 | Paper |
Huff's model for elliptic curves
Lecture Notes in Computer Science | 2010-09-29 | Paper |
Mediated traceable anonymous encryption
Lecture Notes in Computer Science | 2010-08-31 | Paper |
Time-selective convertible undeniable signatures with short conversion receipts
Information Sciences | 2010-07-20 | Paper |
Batch Groth-Sahai
Applied Cryptography and Network Security | 2010-07-06 | Paper |
On the broadcast and validity-checking security of \textsc{pkcs}\#1 v1.5 encryption
Applied Cryptography and Network Security | 2010-07-06 | Paper |
Fair blind signatures without random oracles
Progress in cryptology -- AFRICACRYPT 2010. Third international conference on cryptology in Africa, Stellenbosch, South Africa, May 3--6, 2010. Proceedings | 2010-05-04 | Paper |
Multi-designated verifiers signatures: anonymity without encryption
Information Processing Letters | 2010-01-29 | Paper |
Provably Secure Code-Based Threshold Ring Signatures
Cryptography and Coding | 2010-01-07 | Paper |
Group Signatures with Verifier-Local Revocation and Backward Unlinkability in the Standard Model
Cryptology and Network Security | 2009-11-26 | Paper |
Linear independence measure for squares of periods and quasi-periods of elliptic curves
Journal of Number Theory | 2009-05-28 | Paper |
Adaptive-ID Secure Revocable Identity-Based Encryption
Topics in Cryptology – CT-RSA 2009 | 2009-04-29 | Paper |
NEW EXTENSIONS OF PAIRING-BASED SIGNATURES INTO UNIVERSAL (MULTI) DESIGNATED VERIFIER SIGNATURES
International Journal of Foundations of Computer Science | 2009-04-14 | Paper |
Towards Black-Box Accountable Authority IBE with Short Ciphertexts and Private Keys
Public Key Cryptography – PKC 2009 | 2009-03-24 | Paper |
Gradually Convertible Undeniable Signatures
Applied Cryptography and Network Security | 2009-03-10 | Paper |
Tracing Malicious Proxies in Proxy Re-encryption
Pairing-Based Cryptography – Pairing 2008 | 2009-02-10 | Paper |
On the Soundness of Restricted Universal Designated Verifier Signatures and Dedicated Signatures
Lecture Notes in Computer Science | 2008-06-24 | Paper |
Trapdoor Permutation Polynomials of ℤ/nℤ and Public Key Cryptosystems
Lecture Notes in Computer Science | 2008-06-24 | Paper |
Separation Results on the “One-More” Computational Problems
Topics in Cryptology – CT-RSA 2008 | 2008-04-24 | Paper |
Universally Convertible Directed Signatures
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Discrete-Log-Based Signatures May Not Be Equivalent to Discrete Log
Lecture Notes in Computer Science | 2008-03-18 | Paper |
Short Undeniable Signatures Without Random Oracles: The Missing Link
Progress in Cryptology - INDOCRYPT 2005 | 2008-03-17 | Paper |
Unidirectional Chosen-Ciphertext Secure Proxy Re-encryption
Public key cryptography -- PKC 2008. 11th international workshop on practice and theory in public-key cryptography, Barcelona, Spain, March 9--12, 2008. Proceedings | 2008-03-05 | Paper |
On Kabatianskii-Krouk-Smeets Signatures
Arithmetic of Finite Fields | 2007-11-15 | Paper |
New Extensions of Pairing-Based Signatures into Universal Designated Verifier Signatures
Automata, Languages and Programming | 2007-09-11 | Paper |
Coding and Cryptography
Lecture Notes in Computer Science | 2007-05-02 | Paper |
Security in Communication Networks
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Topics in Cryptology – CT-RSA 2005
Lecture Notes in Computer Science | 2005-12-08 | Paper |
Information and Communications Security
Lecture Notes in Computer Science | 2005-08-19 | Paper |
Universal forgery on Sekhar's signature scheme with message recovery
International Journal of Computer Mathematics | 2005-02-28 | Paper |
