Browse by UCL people
Group by: Type | Date
Number of items: 8.
Article
Bootle, J;
Cerulli, A;
Chaidos, P;
Ghadafi, E;
Groth, J;
(2020)
Foundations of Fully Dynamic Group Signatures.
Journal of Cryptology
, 33
(4)
pp. 1822-1870.
10.1007/s00145-020-09357-w.
|
 |
Proceedings paper
|
Baum, C;
Bootle, J;
Cerulli, A;
del Pino, R;
Groth, J;
Lyubashevsky, V;
(2018)
Sub-linear lattice-based zero-knowledge arguments for arithmetic circuits.
In: Shacham, H and Boldyreva, A, (eds.)
Advances in Cryptology – CRYPTO 2018: 38th Annual International Cryptology Conference, Proceedings, Part II.
(pp. pp. 669-699).
Springer: Cham, Switzerland.
|
|
Bootle, J;
Cerulli, A;
Groth, J;
Jakobsen, S;
Maller, M;
(2018)
Arya: Nearly linear-time zero-knowledge proofs for correct program execution.
In: Peyrin, T and Galbraith, S, (eds.)
Advances in Cryptology – ASIACRYPT 2018: 24th International Conference on the Theory and Application of Cryptology and Information Security, Brisbane, QLD, Australia, December 2–6, 2018, Proceedings, Part I.
(pp. pp. 595-626).
Springer: Cham, Switzerland.
|
|
|
Bootle, J;
Cerulli, A;
Chaidos, P;
Ghadafi, E;
Groth, J;
(2016)
Foundations of Fully Dynamic Group Signatures.
In: Manulis, M and Sadeghi, AR and Schneider, S, (eds.)
ACNS 2016: Applied Cryptography and Network Security.
(pp. pp. 117-136).
Springer International Publishing AG
|
|
|
Bootle, J;
Cerulli, A;
Chaidos, P;
Groth, J;
Petit, C;
(2016)
Efficient Zero-Knowledge Arguments for Arithmetic Circuits in the Discrete Log Setting.
In: Fischlin, M and Coron, JS, (eds.)
Advances in Cryptology – EUROCRYPT 2016.
(pp. pp. 327-357).
Springer Nature
|
|
|
Bootle, J;
Cerulli, A;
Groth, J;
Hajiabadi, M;
Jakobsen, S;
(2017)
Linear-Time Zero-Knowledge Proofs for Arithmetic Circuit Satisfiability.
In: Takagi, T and Peyrin, T, (eds.)
Advances in Cryptology – ASIACRYPT 2017: 23rd International Conference on the Theory and Applications of Cryptology and Information Security: Proceedings, Part III.
(pp. pp. 336-365).
Springer: Cham, Switzerland.
|
|
|
Bootle, J;
Groth, J;
(2018)
Efficient Batch Zero-Knowledge Arguments for Low Degree Polynomials.
In:
PKC 2018: Public-Key Cryptography – PKC 2018.
(pp. pp. 561-588).
Springer Verlag
|
|
Thesis
|
Bootle, Jonathan;
(2019)
Designing Efficient Zero-Knowledge Proofs in the Ideal Linear Commitment Model.
Doctoral thesis (Ph.D), UCL (University College London).
|
|
