The following pages link to (Q4783717):
Displaying 50 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Efficient one-sided adaptively secure computation (Q514477) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Resource fairness and composability of cryptographic protocols (Q656919) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Secure computation without authentication (Q656923) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- Constant-round adaptive zero-knowledge proofs for NP (Q903613) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- On the relationships between notions of simulation-based security (Q1021241) (← links)
- Hybrid commitments and their applications to zero-knowledge proof systems (Q1022606) (← links)
- General composition and universal composability in secure multiparty computation (Q1027983) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Shorter quasi-adaptive NIZK proofs for linear subspaces (Q1698397) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- All-but-many encryption (Q1747665) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- On the (im-)possibility of extending coin toss (Q1994641) (← links)
- A post-quantum UC-commitment scheme in the global random oracle model from code-based assumptions (Q2025352) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Overcoming impossibility results in composable security using interval-wise guarantees (Q2096476) (← links)
- Quantifying the security cost of migrating protocols to practice (Q2096478) (← links)
- Always have a backup plan: fully secure synchronous MPC with asynchronous fallback (Q2096546) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Composition with knowledge assumptions (Q2139641) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Universally composable subversion-resilient cryptography (Q2170002) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Robust digital signature revisited (Q2205942) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
- Lower bounds and impossibility results for concurrent self composition (Q2425531) (← links)
- The reactive simulatability (RSIM) framework for asynchronous systems (Q2464139) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- Environmentally friendly composable multi-party computation in the plain model from standard (timed) assumptions (Q2695656) (← links)
- Non-malleable vector commitments via local equivocability (Q2697900) (← links)
- Generic Construction of UC-Secure Oblivious Transfer (Q2794494) (← links)
- On the Complexity of Additively Homomorphic UC Commitments (Q2796142) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- On Adaptively Secure Multiparty Computation with a Short CRS (Q2827714) (← links)
- Improving Practical UC-Secure Commitments Based on the DDH Assumption (Q2827723) (← links)
- Rate-1, Linear Time and Additively Homomorphic UC Commitments (Q2829947) (← links)
- UC Commitments for Modular Protocol Design and Applications to Revocation and Attribute Tokens (Q2829948) (← links)
- On Constant-Round Concurrent Zero-Knowledge from a Knowledge Assumption (Q2945373) (← links)
