Random walks and concurrent zero-knowledge

DOI10.1007/978-3-030-57808-4_2MaRDI QIDQ2229263zbMATH OpenOpenAlexFDO

Authors Anand Aiyer, Xiao Liang, Nilu Nalini, Omkant Pandey

Publication date 23 February 2021

Full work available at URL https://doi.org/10.1007/978-3-030-57808-4_2

zbMATH Keywords

random walksaverage caseconcurrent zero-knowledgeoptimistic protocols

Mathematics Subject Classification ID

Cryptography (94A60) Computer security (68M25)

Recommendations

• scientific article; zbMATH DE number 1759795
• Lower bounds for concurrent zero knowledge
• Optimistic concurrent zero knowledge
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds

Cites work

• scientific article; zbMATH DE number 176566 (Why is no real title available?)
• scientific article; zbMATH DE number 177820 (Why is no real title available?)
• scientific article; zbMATH DE number 1302862 (Why is no real title available?)
• scientific article; zbMATH DE number 1302864 (Why is no real title available?)
• scientific article; zbMATH DE number 1304087 (Why is no real title available?)
• scientific article; zbMATH DE number 1759795 (Why is no real title available?)
• scientific article; zbMATH DE number 1775426 (Why is no real title available?)
• scientific article; zbMATH DE number 2087596 (Why is no real title available?)
• scientific article; zbMATH DE number 1842483 (Why is no real title available?)
• scientific article; zbMATH DE number 3249395 (Why is no real title available?)
• Advances in Cryptology – CRYPTO 2004
• All of Nonparametric Statistics
• Automata, Languages and Programming
• Black-box concurrent zero-knowledge requires \(\tilde{\omega}(\log n)\) rounds
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Client-server concurrent zero knowledge with constant rounds and guaranteed complexity
• Concurrent and resettable zero-knowledge in poly-logarithmic rounds
• Concurrent zero knowledge in the bounded player model
• Concurrent zero-knowledge with timing, revisited
• Constant-round concurrent zero-knowledge from indistinguishability obfuscation
• Eye for an eye: efficient concurrent zero-knowledge in the timing model
• Fast Paxos
• Obfuscation-based non-black-box simulation and four message concurrent zero knowledge for NP
• On constant-round concurrent zero-knowledge from a knowledge assumption
• On round-optimal zero knowledge in the bare public-key model
• Optimistic concurrent zero knowledge
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Public-coin differing-inputs obfuscation and its applications
• Random walks and concurrent zero-knowledge
• Resettable zero-knowledge (extended abstract)
• Return probabilities for random walk on a half-line
• Return probabilities for the reflected random walk on \(\mathbb N_0\)
• The knowledge complexity of interactive proof-systems
• The probabilistic method

Cited in

(1)

• Random walks and concurrent zero-knowledge

This page was built for publication: Random walks and concurrent zero-knowledge

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2229263)