The following pages link to New notions of security (Q3580997):
Displaying 29 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← 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)
- 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)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- Succinct non-interactive secure computation (Q2119013) (← links)
- A unified and composable take on ratcheting (Q2175936) (← links)
- Efficient hybrid encryption from ID-based encryption (Q2267789) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← 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)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- What Security Can We Achieve Within 4 Rounds? (Q2827735) (← 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)
- Local Sequentiality Does Not Help for Concurrent Composition (Q3623059) (← 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)
- Conditional Reactive Simulatability (Q5862529) (← links)
- Efficient non-malleable commitment schemes (Q5902225) (← links)
- Efficient non-malleable commitment schemes (Q5920255) (← links)
- Concurrently composable non-interactive secure computation (Q6135409) (← links)
- A new approach to efficient non-malleable zero-knowledge (Q6166959) (← links)
- On concurrent multi-party quantum computation (Q6190133) (← links)