Obserwuj
Jens Groth
Jens Groth
Principal Researcher, DFINITY
Zweryfikowany adres z ucl.ac.uk - Strona główna
Tytuł
Cytowane przez
Cytowane przez
Rok
Efficient non-interactive proof systems for bilinear groups
J Groth, A Sahai
Annual International Conference on the Theory and Applications of …, 2008
10272008
On the size of pairing-based non-interactive arguments
J Groth
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
6812016
Short Pairing-Based Non-interactive Zero-Knowledge Arguments.
J Groth
Asiacrypt 6477, 321-340, 2010
4722010
Simulation-sound NIZK proofs for a practical language and constant size group signatures
J Groth
Advances in Cryptology–ASIACRYPT 2006: 12th International Conference on the …, 2006
4192006
Perfect non-interactive zero knowledge for NP
J Groth, R Ostrovsky, A Sahai
Advances in Cryptology-EUROCRYPT 2006: 24th Annual International Conference …, 2006
4112006
Structure-preserving signatures and commitments to group elements
M Abe, G Fuchsbauer, J Groth, K Haralambiev, M Ohkubo
Advances in Cryptology–CRYPTO 2010: 30th Annual Cryptology Conference, Santa …, 2010
3722010
Fully anonymous group signatures without random oracles
J Groth
Advances in Cryptology–ASIACRYPT 2007: 13th International Conference on the …, 2007
2992007
Group signatures: Better efficiency and new theoretical aspects
J Camenisch, J Groth
Security in Communication Networks: 4th International Conference, SCN 2004 …, 2005
2832005
Efficient zero-knowledge arguments for arithmetic circuits in the discrete log setting
J Bootle, A Cerulli, P Chaidos, J Groth, C Petit
Advances in Cryptology–EUROCRYPT 2016: 35th Annual International Conference …, 2016
2752016
Efficient zero-knowledge argument for correctness of a shuffle
S Bayer, J Groth
Advances in Cryptology–EUROCRYPT 2012: 31st Annual International Conference …, 2012
2632012
A verifiable secret shuffe of homomorphic encryptions
J Groth
Public Key Cryptography—PKC 2003: 6th International Workshop on Practice …, 2002
2272002
Non-interactive zaps and new techniques for NIZK
J Groth, R Ostrovsky, A Sahai
CRYPTO 4117, 97-111, 2006
2252006
New techniques for noninteractive zero-knowledge
J Groth, R Ostrovsky, A Sahai
Journal of the ACM (JACM) 59 (3), 1-35, 2012
1932012
One-out-of-many proofs: Or how to leak a secret and spend a coin
J Groth, M Kohlweiss
Advances in Cryptology-EUROCRYPT 2015: 34th Annual International Conference …, 2015
1862015
Snarky signatures: Minimal signatures of knowledge from simulation-extractable SNARKs
J Groth, M Maller
Advances in Cryptology–CRYPTO 2017: 37th Annual International Cryptology …, 2017
1762017
Efficient noninteractive proof systems for bilinear groups
J Groth, A Sahai
SIAM Journal on Computing 41 (5), 1193-1232, 2012
1692012
Non-interactive zero-knowledge arguments for voting
J Groth
Applied Cryptography and Network Security: Third International Conference …, 2005
1542005
Non-interactive and reusable non-malleable commitment schemes
I Damgard, J Groth
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing …, 2003
1482003
Updatable and universal common reference strings with applications to zk-SNARKs
J Groth, M Kohlweiss, M Maller, S Meiklejohn, I Miers
Advances in Cryptology–CRYPTO 2018: 38th Annual International Cryptology …, 2018
1452018
Optimal structure-preserving signatures in asymmetric bilinear groups
M Abe, J Groth, K Haralambiev, M Ohkubo
Advances in Cryptology–CRYPTO 2011, 649-666, 2011
1402011
Nie można teraz wykonać tej operacji. Spróbuj ponownie później.
Prace 1–20