scientific article; zbMATH DE number 2009954
From MaRDI portal
Publication:4434874
zbMATH Open1037.68536MaRDI QIDQ4434874FDOQ4434874
Authors: 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 of this publication is not available (Why is that?)
Recommendations
- scientific article; zbMATH DE number 7651155
- Constructive simulation and topological design of protocols
- scientific article
- Theory of Cryptography
- Handling expected polynomial-time strategies in simulation-based security proofs
- scientific article; zbMATH DE number 1927559
- Composition of cryptographic protocols in a probabilistic polynomial-time process calculus.
- Strict Polynomial-Time in Simulation and Extraction
Data encryption (aspects in computer science) (68P25) Cryptography (94A60) Network protocols (68M12)
Cited In (53)
- Two-round concurrent 2PC from sub-exponential LWE
- On concurrent multi-party quantum computation
- NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness
- Succinct non-interactive secure computation
- Knowledge encryption and its applications to simulatable protocols with low round-complexity
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph
- Title not available (Why is that?)
- A black-box approach to post-quantum zero-knowledge in constant rounds
- A note on the Dwork-Naor timed deniable authentication
- What security can we achieve within 4 rounds?
- Indistinguishable proofs of work or knowledge
- One-message zero knowledge and non-malleable commitments
- Non-malleable codes for bounded parallel-time tampering
- Efficient NIZK arguments with straight-line simulation and extraction
- Improved OR-composition of sigma-protocols
- Concurrent non-malleable commitments (and more) in 3 rounds
- Steganography-free zero-knowledge
- Title not available (Why is that?)
- Maliciously-secure MrNISC in the plain model
- Impossibility results for universal composability in public-key models and with fixed inputs
- What Security Can We Achieve Within 4 Rounds?
- Unbounded ABE via bilinear entropy expansion, revisited
- Hybrid commitments and their applications to zero-knowledge proof systems
- Concurrently composable non-interactive secure computation
- Constant round adaptively secure protocols in the tamper-proof hardware model
- Adaptive hardness and composable security in the plain model from standard assumptions
- 3-message zero knowledge against human ignorance
- Statistical Zaps and new oblivious transfer protocols
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions
- Towards accountability in CRS generation
- Proofs of Work from worst-case assumptions
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions
- A unified and composable take on ratcheting
- Weak Zero-Knowledge beyond the Black-Box Barrier
- On non-black-box simulation and the impossibility of approximate obfuscation
- Concurrently composable security with shielded super-polynomial simulators
- A new approach to efficient non-malleable zero-knowledge
- Title not available (Why is that?)
- Individual simulations
- Adaptive security of multi-party protocols, revisited
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions
- Two-round maliciously secure computation with super-polynomial simulation
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation
- On constant-round concurrent zero-knowledge from a knowledge assumption
- General composition and universal composability in secure multiparty computation
- Local Sequentiality Does Not Help for Concurrent Composition
- Overcoming impossibility results in composable security using interval-wise guarantees
- On the exact round complexity of self-composable two-party computation
- Round-efficient black-box construction of composable multi-party computation
- Public-coin 3-round zero-knowledge from learning with errors and keyless multi-collision-resistant hash
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4434874)
