Random walks and concurrent zero-knowledge
From MaRDI portal
Publication:2229263
DOI10.1007/978-3-030-57808-4_2OpenAlexW3013330232MaRDI QIDQ2229263
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
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Return probabilities for random walk on a half-line
- Fast Paxos
- Random walks and concurrent zero-knowledge
- Return probabilities for the reflected random walk on \(\mathbb N_0\)
- Candidate Indistinguishability Obfuscation and Functional Encryption for All Circuits
- Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
- On Round-Optimal Zero Knowledge in the Bare Public-Key Model
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption
- Optimistic Concurrent Zero Knowledge
- Resettable zero-knowledge (extended abstract)
- Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model
- Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation
- Concurrent zero-knowledge with timing, revisited
- The knowledge complexity of interactive proof-systems
- Concurrent Zero Knowledge in the Bounded Player Model
- Public-Coin Concurrent Zero-Knowledge in the Global Hash Model
- Concurrent and resettable zero-knowledge in poly-loalgorithm rounds
- Black-box concurrent zero-knowledge requires \tilde {Ω} (log n ) rounds
- Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP
- Public-Coin Differing-Inputs Obfuscation and Its Applications
- Advances in Cryptology – CRYPTO 2004
- All of Nonparametric Statistics
- Automata, Languages and Programming
This page was built for publication: Random walks and concurrent zero-knowledge
