Pages that link to "Item:Q2821797"
From MaRDI portal
The following pages link to Adaptive hardness and composable security in the plain model from standard assumptions (Q2821797):
Displaying 28 items.
- One-message zero knowledge and non-malleable commitments (Q1629409) (← links)
- On the security loss of unique signatures (Q1629431) (← links)
- Continuous NMC secure against permutations and overwrites, with applications to CCA secure commitments (Q1631329) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- What security can we achieve within 4 rounds? (Q2010586) (← links)
- Black-box non-interactive non-malleable commitments (Q2056786) (← links)
- Non-interactive distributional indistinguishability (NIDI) and non-malleable commitments (Q2056787) (← links)
- On the CCA compatibility of public-key infrastructure (Q2061956) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- COA-secure obfuscation and applications (Q2170027) (← links)
- Non-malleable commitments against quantum attacks (Q2170101) (← links)
- Statistical concurrent non-malleable zero-knowledge from one-way functions (Q2188970) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments (Q2867225) (← 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 Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation (Q3449562) (← links)
- Composition Implies Adaptive Security in Minicrypt (Q3593104) (← links)
- Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles (Q5117380) (← 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)
- Theory of Cryptography (Q5898363) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5915839) (← links)
- Can PPAD hardness be based on standard cryptographic assumptions? (Q5925502) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- Composable long-term security with rewinding (Q6587965) (← links)
