Pages that link to "Item:Q3612244"
From MaRDI portal
The following pages link to Polylogarithmic two-round argument systems (Q3612244):
Displaying 11 items.
- Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs (Q1648790) (← links)
- The hunting of the SNARK (Q1698394) (← links)
- On succinct arguments and witness encryption from groups (Q2096510) (← links)
- Succinct non-interactive arguments via linear interactive proofs (Q2136170) (← links)
- Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs (Q2799089) (← links)
- On the existence of extractable one-way functions (Q2829449) (← links)
- Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems (Q2829945) (← links)
- On the (In)Security of SNARKs in the Presence of Oracles (Q3179354) (← links)
- Lattice-Based SNARGs and Their Application to More Efficient Obfuscation (Q5270364) (← links)
- Automata, Languages and Programming (Q5716769) (← links)
- A new type of polytomous surmise system (Q6050993) (← links)