Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
Browse
Publications
Preprints
About
About UCL Open: Env.
Aims and Scope
Editorial Board
Indexing
APCs
How to cite
Publishing policies
Editorial policy
Peer review policy
Equality, Diversity & Inclusion
About UCL Press
Contact us
For authors
Information for authors
How it works
Benefits of publishing with us
Submit
How to submit
Preparing your manuscript
Article types
Open Data
ORCID
APCs
Contributor agreement
For reviewers
Information for reviewers
Review process
How to peer review
Peer review policy
My ScienceOpen
Sign in
Register
Dashboard
Search
4
views
45
references
Top references
cited by
0
Cite as...
0 reviews
Review
0
comments
Comment
0
recommends
+1
Recommend
0
collections
Add to
0
shares
Share
Twitter
Sina Weibo
Facebook
Email
1,872
similar
All similar
Record
: found
Abstract
: not found
Book Chapter
: not found
Advances in Cryptology – CRYPTO 2021 : 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16–20, 2021, Proceedings, Part I
Sumcheck Arguments and Their Applications
other
Author(s):
Jonathan Bootle
,
Alessandro Chiesa
,
Katerina Sotiraki
Publication date
(Online):
August 11 2021
Publisher:
Springer International Publishing
Read this book at
Publisher
Buy book
Review
Review book
Invite someone to review
Bookmark
Cite as...
There is no author summary for this book yet. Authors can add summaries to their books on ScienceOpen to make them more accessible to a non-specialist audience.
Related collections
Electrospinning for biomedical applications
Most cited references
45
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Bulletproofs: Short Proofs for Confidential Transactions and More
Benedikt Bunz
,
Jonathan Bootle
,
Dan Boneh
…
(2018)
0
comments
Cited
49
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
Delegating computation
Shafi Goldwasser
,
Yael Tauman Kalai
,
Guy Rothblum
(2008)
0
comments
Cited
47
times
– based on
0
reviews
Bookmark
Record
: found
Abstract
: not found
Conference Proceedings
: not found
A note on efficient zero-knowledge proofs and arguments (extended abstract)
Joe Kilian
(1992)
0
comments
Cited
42
times
– based on
0
reviews
Bookmark
All references
Author and book information
Book Chapter
Publication date (Print):
2021
Publication date (Online):
August 11 2021
Pages
: 742-773
DOI:
10.1007/978-3-030-84242-0_26
SO-VID:
fbc3e5f2-bec4-4ead-952c-c94d7b4f961d
History
Data availability:
Comments
Comment on this book
Sign in to comment
Book chapters
pp. 3
Which E-Voting Problems Do We Need to Solve?
pp. 11
On the Possibility of Basing Cryptography on \(\mathsf{EXP}\ne \mathsf{BPP}\)
pp. 41
Linear Cryptanalysis of FF3-1 and FEA
pp. 70
Efficient Key Recovery for All HFE Signature Variants
pp. 94
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
pp. 127
Threshold Schnorr with Stateless Deterministic Signing from Standard Assumptions
pp. 157
Two-Round Trip Schnorr Multi-signatures via Delinearized Witnesses
pp. 189
MuSig2: Simple Two-Round Schnorr Multi-signatures
pp. 251
DualRing: Generic Construction of Ring Signatures with Efficient Instantiations
pp. 282
Compact Ring Signatures from Learning with Errors
pp. 315
A Black-Box Approach to Post-Quantum Zero-Knowledge in Constant Rounds
pp. 346
On the Concurrent Composition of Quantum Zero-Knowledge
pp. 375
Multi-theorem Designated-Verifier NIZK for QMA
pp. 406
On the Round Complexity of Secure Quantum Computation
pp. 436
Round Efficient Secure Multiparty Quantum Computation with Identifiable Abort
pp. 467
One-Way Functions Imply Secure Computation in a Quantum World
pp. 497
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
pp. 526
New Approaches for Quantum Copy-Protection
pp. 556
Hidden Cosets and Applications to Unclonable Cryptography
pp. 585
On Tight Quantum Security of HMAC and NMAC in the Quantum Random Oracle Model
pp. 616
Quantum Collision Attacks on Reduced SHA-256 and SHA-512
pp. 649
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments
pp. 681
Proof-Carrying Data Without Succinct Arguments
pp. 711
Subquadratic SNARGs in the Random Oracle Model
pp. 742
Sumcheck Arguments and Their Applications
pp. 774
An Algebraic Framework for Universal and Updatable SNARKs
Similar content
1,872
Using self-paced reading in research with heritage speakers: a role for reading skill in the online processing of Spanish verb argument specifications
Authors:
Jill Jegerski
,
Gregory D. Keating
"If You Don't Like It Leave It" The Problem of Exit in Social Contractarian Arguments
Authors:
BARBARA FRIED
QUINE’S PROXY-FUNCTION ARGUMENT FOR THE INDETERMINACY OF REFERENCE AND FREGE’S CAESAR PROBLEM
Authors:
DIRK GREIMANN
See all similar