Pages that link to "Item:Q4924421"

The following pages link to Streaming Authenticated Data Structures (Q4924421):

Displaying 21 items.

• Authenticated hash tables based on cryptographic accumulators (Q262258) (← links)
• The hunting of the SNARK (Q1698394) (← links)
• A general model for authenticated data structures (Q1879358) (← links)
• Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
• Vector and functional commitments from lattices (Q2697903) (← links)
• Practical verified computation with streaming interactive proofs (Q2826047) (← links)
• Computing on Authenticated Data (Q2891473) (← links)
• Signature Schemes with Efficient Protocols and Dynamic Group Signatures from Lattice Assumptions (Q2953783) (← links)
• Streaming computations with a loquacious prover (Q2986880) (← links)
• (Q4417419) (← links)
• Verifiable Stream Computation and Arthur--Merlin Communication (Q5232326) (← links)
• Zero-knowledge proofs for set membership: efficient, succinct, modular (Q6063130) (← links)
• Functional commitments for all functions, with transparent setup and from SIS (Q6063522) (← links)
• Merkle tree ladder mode: reducing the size impact of NIST PQC signature algorithms in practice (Q6080919) (← links)
• Zero-knowledge arguments for lattice-based accumulators: logarithmic-size ring signatures and group signatures without trapdoors (Q6110389) (← links)
• On the impossibility of algebraic vector commitments in pairing-free groups (Q6114273) (← links)
• New unbounded verifiable data streaming for batch query with almost optimal overhead (Q6173295) (← links)
• Lattice-based functional commitments: fast verification and cryptanalysis (Q6604929) (← links)
• Discriminants of number fields (Q6618241) (← links)
• Succinct functional commitments for circuits from \(k\)-\textsf{Lin} (Q6636508) (← links)
• Polynomial commitments from lattices: post-quantum security, fast verification and transparent setup (Q6660298) (← links)