Polylogarithmic two-round argument systems

DOI10.1515/JMC.2008.016zbMath1158.94003MaRDI QIDQ3612244

Thilo Mie

Publication date: 3 March 2009

Published in: Journal of Mathematical Cryptology (Search for Journal in Brave)

zbMATH Keywords

private information retrievalargument systemspooky interactions

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (10)

Succinct non-interactive arguments via linear interactive proofs ⋮ On the (In)Security of SNARKs in the Presence of Oracles ⋮ Short, invertible elements in partially splitting cyclotomic rings and applications to lattice-based zero-knowledge proofs ⋮ The hunting of the SNARK ⋮ Unnamed Item ⋮ Quasi-Linear Size Zero Knowledge from Linear-Algebraic PCPs ⋮ On the Existence of Extractable One-Way Functions ⋮ Spooky Interaction and Its Discontents: Compilers for Succinct Two-Message Argument Systems ⋮ On succinct arguments and witness encryption from groups ⋮ Lattice-Based SNARGs and Their Application to More Efficient Obfuscation

Cites Work

• On the complexity of interactive proofs with bounded communication
• Minimum disclosure proofs of knowledge
• On interactive proofs with a laconic prover
• Proof verification and the hardness of approximation problems
• Private information retrieval
• Probabilistic checking of proofs
• An improved algorithm for computing logarithms over<tex>GF(p)</tex>and its cryptographic significance (Corresp.)
• Towards Plaintext-Aware Public-Key Encryption Without Random Oracles

This page was built for publication: Polylogarithmic two-round argument systems