scientific article; zbMATH DE number 2009954

zbMath1037.68536MaRDI QIDQ4434874

Rafael Pass

Publication date: 26 November 2003

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2656/26560160.htm

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

zero-knowledge proofsquasi-polynomial timeprotocol composition

Mathematics Subject Classification ID

Related Items (48)

A black-box approach to post-quantum zero-knowledge in constant rounds ⋮ Non-malleable codes for bounded parallel-time tampering ⋮ One-message zero knowledge and non-malleable commitments ⋮ On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation ⋮ A note on the Dwork-Naor timed deniable authentication ⋮ 3-Message Zero Knowledge Against Human Ignorance ⋮ Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity ⋮ Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions ⋮ Unbounded ABE via bilinear entropy expansion, revisited ⋮ Proofs of Work from worst-case assumptions ⋮ A unified and composable take on ratcheting ⋮ On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption ⋮ Maliciously-secure MrNISC in the plain model ⋮ Indistinguishable Proofs of Work or Knowledge ⋮ Concurrently composable non-interactive secure computation ⋮ Knowledge encryption and its applications to simulatable protocols with low round-complexity ⋮ Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash ⋮ Efficient NIZK arguments with straight-line simulation and extraction ⋮ A new approach to efficient non-malleable zero-knowledge ⋮ Steganography-free zero-knowledge ⋮ On concurrent multi-party quantum computation ⋮ Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation ⋮ Individual simulations ⋮ Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ Adaptive security of multi-party protocols, revisited ⋮ Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions ⋮ Impossibility results for universal composability in public-key models and with fixed inputs ⋮ Round-efficient black-box construction of composable multi-party computation ⋮ Computing boundary cycle of a pseudo-triangle polygon from its visibility graph ⋮ Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model ⋮ Concurrently Composable Security with Shielded Super-Polynomial Simulators ⋮ On the Exact Round Complexity of Self-composable Two-Party Computation ⋮ What security can we achieve within 4 rounds? ⋮ Improved OR-Composition of Sigma-Protocols ⋮ Local Sequentiality Does Not Help for Concurrent Composition ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Round-optimal blind signatures in the plain model from classical and quantum standard assumptions ⋮ Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments ⋮ Towards accountability in CRS generation ⋮ Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions ⋮ Hybrid commitments and their applications to zero-knowledge proof systems ⋮ What Security Can We Achieve Within 4 Rounds? ⋮ General composition and universal composability in secure multiparty computation ⋮ Concurrent Non-Malleable Commitments (and More) in 3 Rounds ⋮ Overcoming impossibility results in composable security using interval-wise guarantees ⋮ Weak Zero-Knowledge beyond the Black-Box Barrier ⋮ Succinct non-interactive secure computation

This page was built for publication: