Secure identity based encryption without random oracles, LNCS, vol.3152, pp.443-459, 2004. ,
Short signatures without random oracles and the SDH assumption in bilinear groups, Journal of Cryptology, vol.21, issue.2, p.19, 2008. ,
Efficient batch zero-knowledge arguments for low degree polynomials, PKC 2018, Part II, vol.10770, pp.561-588, 2018. ,
Efficient protocols for set membership and range proofs, LNCS, vol.5350, p.40, 2005. ,
Universally composable twoparty and multi-party secure computation, 34th ACM STOC, pp.494-503, 2002. ,
Ring signatures of sub-linear size without random oracles, LNCS, vol.4596, pp.423-434, 2007. ,
Square span programs with applications to succinct NIZK arguments, ASI-ACRYPT 2014, Part I, vol.8873, p.19, 2006. ,
Fine-tuning Groth-Sahai proofs, LNCS, vol.8383, p.10, 2005. ,
An algebraic framework for Diffie-Hellman assumptions, CRYPTO 2013, Part II, vol.8043, pp.129-147, 2013. ,
An efficient pairing-based shuffle argument, Part, vol.II, pp.97-127, 2004. ,
Quadratic span programs and succinct NIZKs without PCPs, LNCS, vol.7881, p.19, 2006. ,
Separating succinct non-interactive arguments from all falsifiable assumptions, 43rd ACM STOC, pp.99-108, 2002. ,
A ring signature of size O( 3 ? n) without random oracles. Cryptology ePrint Archive, 2017. ,
QA-NIZK arguments in asymmetric groups: New tools and new constructions, ASI-ACRYPT 2015, Part I, volume 9452 of LNCS, vol.40, p.42, 2015. ,
New techniques for non-interactive shuffle and range arguments, LNCS, vol.16, p.28, 2016. ,
Short pairing-based non-interactive zero-knowledge arguments, ASIACRYPT 2010, vol.6477, pp.321-340 ,
, , vol.2, p.5, 2010.
On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, p.6, 2005. ,
A non-interactive shuffle with pairing based verifiability, LNCS, vol.4833, pp.51-67, 2004. ,
New techniques for noninteractive zeroknowledge, J. ACM, vol.59, issue.3, p.3, 2012. ,
Efficient non-interactive proof systems for bilinear groups, LNCS, vol.4965, p.10, 2008. ,
Efficient noninteractive proof systems for bilinear groups, SIAM J. Comput, vol.41, issue.5, pp.1193-1232, 2012. ,
Shorter quasi-adaptive NIZK proofs for linear subspaces, ASIACRYPT 2013, Part I, vol.8269, p.41, 2006. ,
Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces, CRYPTO 2014, Part II, vol.8617, p.11, 2004. ,
Quasi-adaptive NIZK for linear subspaces revisited, EUROCRYPT 2015, Part II, vol.9057, p.11, 2002. ,
URL : https://hal.archives-ouvertes.fr/hal-01220192
Non-malleability from malleability: Simulation-sound quasi-adaptive NIZK proofs and CCA2-secure encryption from homomorphic signatures, LNCS, vol.8441, issue.6, pp.514-532, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00983147
Progression-free sets and sublinear pairing-based non-interactive zeroknowledge arguments, LNCS, vol.7194, pp.169-189, 2006. ,
Succinct non-interactive zero knowledge arguments from span programs and linear error-correcting codes, ASI-ACRYPT 2013, Part I, vol.8269, pp.41-60, 2013. ,
The kernel matrix Diffie-Hellman assumption, ASIACRYPT 2016, Part I, volume 10031 of LNCS, pp.729-758, 2008. ,
On cryptographic assumptions and challenges (invited talk), LNCS, vol.2729, pp.96-109, 2002. ,
Stretching groth-sahai: NIZK proofs of partial satisfiability, TCC 2015, Part II, vol.9015, pp.247-276, 1920. ,
Universally composable adaptive priced oblivious transfer, LNCS, vol.5671, p.41, 2006. ,
Optimal reductions of some decisional problems to the rank problem, LNCS, vol.7658, p.42, 2012. ,