Square span programs with applications to succinct NIZK arguments, ASI-ACRYPT 2014, Part I, vol.8873, p.25, 2014. ,
Shorter quadratic QA-NIZK proofs, PKC 2019, Part I, volume 11442 of LNCS, vol.3, p.28, 2019. ,
URL : https://hal.archives-ouvertes.fr/hal-02399179
Fine-tuning Groth-Sahai proofs, LNCS, vol.8383, pp.630-649, 1924. ,
An algebraic framework for Diffie-Hellman assumptions, Journal of Cryptology, vol.30, issue.1, p.5, 2017. ,
An efficient pairing-based shuffle argument, Part, vol.II, p.15, 2005. ,
Practical short signature batch verification, LNCS, vol.5473, p.25, 2009. ,
Non-interactive verifiable computing: Outsourcing computation to untrusted workers, CRYPTO 2010, vol.6223, pp.465-482, 2007. ,
Quadratic span programs and succinct NIZKs without PCPs, LNCS, vol.7881, p.11, 2004. ,
Fully homomorphic encryption using ideal lattices, 41st ACM STOC, pp.169-178, 2009. ,
Using fully homomorphic hybrid encryption to minimize non-interative zero-knowledge proofs, Journal of Cryptology, vol.28, issue.4, pp.820-843, 2006. ,
Separating succinct non-interactive arguments from all falsifiable assumptions, 43rd ACM STOC, pp.99-108, 2002. ,
Towards a classification of non-interactive computational assumptions in cyclic groups, ASI-ACRYPT 2017, vol.II, p.9, 2017. ,
Delegating computation: interactive proofs for muggles, 40th ACM STOC, vol.6, p.7, 2008. ,
QA-NIZK arguments in asymmetric groups: New tools and new constructions, ASI-ACRYPT 2015, Part I, vol.9452, p.28, 2009. ,
Short pairing-based non-interactive zero-knowledge arguments, ASIACRYPT 2010, vol.6477, pp.321-340 ,
, , 2002.
On the size of pairing-based non-interactive arguments, EUROCRYPT 2016, Part II, vol.9666, p.7, 2016. ,
Non-interactive zaps and new techniques for NIZK, LNCS, vol.4117, pp.97-111, 2006. ,
Perfect non-interactive zero knowledge for NP, LNCS, vol.4004, issue.6, pp.339-358, 2006. ,
Efficient non-interactive proof systems for bilinear groups, LNCS, vol.4965, p.6, 2008. ,
Efficient noninteractive proof systems for bilinear groups, SIAM J. Comput, vol.41, issue.5, p.24, 2012. ,
New techniques for structural batch verification in bilinear groups with applications to groth-sahai proofs, ACM CCS 2017, vol.23, p.25, 2017. ,
URL : https://hal.archives-ouvertes.fr/hal-01643558
Shorter quasi-adaptive NIZK proofs for linear subspaces, ASIACRYPT 2013, Part I, vol.8269, p.6, 2013. ,
Switching lemma for bilinear tests and constant-size NIZK proofs for linear subspaces, CRYPTO 2014, Part II, vol.8617, p.14, 2004. ,
On publicly verifiable delegation from standard assumptions, Cryptology ePrint Archive, vol.776, p.7, 2018. ,
How to delegate computations: the power of no-signaling proofs, 46th ACM STOC, pp.485-494, 2014. ,
Quasi-adaptive NIZK for linear subspaces revisited, LNCS, vol.II, p.18, 2015. ,
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, p.17, 2014. ,
URL : https://hal.archives-ouvertes.fr/hal-00983147
Short group signatures via structure-preserving signatures: Standard model security from simple assumptions, CRYPTO 2015, Part II, vol.9216, p.6, 2015. ,
URL : https://hal.archives-ouvertes.fr/hal-01225353
Progression-free sets and sublinear pairing-based non-interactive zeroknowledge arguments, LNCS, vol.7194, pp.169-189, 2002. ,
Algebraic methods for interactive proof systems, 31st FOCS, pp.2-10, 1990. ,
Sonic: Zero-knowledge snarks from linear-size universal and updateable structured reference string. Cryptology ePrint Archive, 2019. ,
The kernel matrix Diffie-Hellman assumption, ASIACRYPT 2016, Part I, volume 10031 of LNCS, vol.8, p.9, 2016. ,
On cryptographic assumptions and challenges (invited talk), LNCS, vol.2729, pp.96-109, 2002. ,
On zero-testable homomorphic encryption and publicly verifiable non-interactive arguments, Part, vol.II, pp.283-315, 2007. ,
Pinocchio: Nearly practical verifiable computation, 2013 IEEE Symposium on Security and Privacy, pp.238-252, 2013. ,
Noninteractive zero knowledge for np from (plain) learning with errors. Cryptology ePrint Archive, 2019. ,