The following pages link to (Q4434874):
Displaying 49 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- A note on the Dwork-Naor timed deniable authentication (Q845814) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- Unbounded ABE via bilinear entropy expansion, revisited (Q1648812) (← links)
- Proofs of Work from worst-case assumptions (Q1673424) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- Computing boundary cycle of a pseudo-triangle polygon from its visibility graph (Q1997264) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Round-optimal blind signatures in the plain model from classical and quantum standard assumptions (Q2056693) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- A black-box approach to post-quantum zero-knowledge in constant rounds (Q2120081) (← links)
- Non-malleable codes for bounded parallel-time tampering (Q2129009) (← links)
- A unified and composable take on ratcheting (Q2175936) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← links)
- Individual simulations (Q2691606) (← links)
- Black-box impossibilities of obtaining 2-round weak ZK and strong WI from polynomial hardness (Q2695641) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- Adaptive security of multi-party protocols, revisited (Q2695654) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Improved OR-Composition of Sigma-Protocols (Q2799092) (← links)
- Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← links)
- Concurrent Non-Malleable Commitments (and More) in 3 Rounds (Q2829950) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
- Indistinguishable Proofs of Work or Knowledge (Q2953800) (← links)
- 3-Message Zero Knowledge Against Human Ignorance (Q3179352) (← links)
- Composable Security in the Tamper-Proof Hardware Model Under Minimal Complexity (Q3179364) (← links)
- Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions (Q3179365) (← links)
- On expected polynomial time simulation of zero knowledge protocols (Q3210167) (← links)
- On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- (Q3589606) (← links)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← links)
- Weak Zero-Knowledge beyond the Black-Box Barrier (Q5026393) (← links)
- Constant Round Adaptively Secure Protocols in the Tamper-Proof Hardware Model (Q5738764) (← links)
- Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883) (← links)
- On the Exact Round Complexity of Self-composable Two-Party Computation (Q5738974) (← links)
- (Q5874482) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- Knowledge encryption and its applications to simulatable protocols with low round-complexity (Q6135438) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Steganography-free zero-knowledge (Q6169351) (← links)
- Two-round concurrent 2PC from sub-exponential LWE (Q6595674) (← links)
- NIZKs with maliciously chosen CRS: subversion advice-ZK and accountable soundness (Q6660376) (← links)
