Random walks and concurrent zero-knowledge

DOI10.1007/978-3-030-57808-4_2OpenAlexW3013330232MaRDI QIDQ2229263FDOQ2229263

Nilu Nalini, Xiao Liang, Anand Aiyer, 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)

Cites Work

• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• All of Nonparametric Statistics
• The probabilistic method
• On Round-Optimal Zero Knowledge in the Bare Public-Key Model
• Resettable zero-knowledge (extended abstract)
• The knowledge complexity of interactive proof-systems
• Concurrent Zero Knowledge in the Bounded Player Model
• Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
• Advances in Cryptology – CRYPTO 2004
• Candidate indistinguishability obfuscation and functional encryption for all circuits
• Fast Paxos
• Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
• Public-Coin Differing-Inputs Obfuscation and Its Applications
• Return probabilities for random walk on a half-line
• Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
• Concurrent zero-knowledge with timing, revisited
• Automata, Languages and Programming
• Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
• On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
• Return probabilities for the reflected random walk on \(\mathbb N_0\)
• Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
• Random walks and concurrent zero-knowledge
• Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
• Optimistic Concurrent Zero Knowledge
• Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model

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)