scientific article; zbMATH DE number 1304087
From MaRDI portal
Publication:4250778
zbMath0932.68046MaRDI QIDQ4250778
Publication date: 13 March 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
On the concurrent composition of quantum zero-knowledge, Concurrent knowledge extraction in public-key models, On the security loss of unique signatures, On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation, Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions, Minimal Assumptions and Round Complexity for Concurrent Zero-Knowledge in the Bare Public-Key Model, Non-black-box simulation in the fully concurrent setting, revisited, Lower bounds and impossibility results for concurrent self composition, The power of undirected rewindings for adaptive security, On constant-round concurrent non-malleable proof systems, Individual simulations, Public-coin parallel zero-knowledge for NP, Leakproof secret sharing protocols with applications to group identification scheme, Possibility and impossibility results for selective decommitments, Concurrent zero knowledge, revisited, Round-efficient black-box construction of composable multi-party computation, Random walks and concurrent zero-knowledge, Simpler session-key generation from short random passwords, Lower bounds for non-black-box zero knowledge, The Round-Complexity of Black-Box Zero-Knowledge: A Combinatorial Characterization, Local Sequentiality Does Not Help for Concurrent Composition, Possibility and Impossibility Results for Encryption and Commitment Secure under Selective Opening, Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions, Hybrid commitments and their applications to zero-knowledge proof systems, General composition and universal composability in secure multiparty computation, Two-Message, Oblivious Evaluation of Cryptographic Functionalities, Eye for an Eye: Efficient Concurrent Zero-Knowledge in the Timing Model, Efficiency Preserving Transformations for Concurrent Non-malleable Zero Knowledge
