Pages that link to "Item:Q3596372"
From MaRDI portal
The following pages link to Universally Composable Security with Global Setup (Q3596372):
Displaying 50 items.
- Possibility and impossibility results for selective decommitments (Q451116) (← links)
- Long-term security and universal composability (Q604632) (← links)
- Secure computation without authentication (Q656923) (← links)
- Identity-based trapdoor mercurial commitments and applications (Q719291) (← links)
- Cryptography in the multi-string model (Q744350) (← links)
- Linearly homomorphic structure-preserving signatures and their applications (Q887427) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Safely composing security protocols (Q1028731) (← links)
- Two-round adaptively secure multiparty computation from standard assumptions (Q1629408) (← links)
- Pattern matching on encrypted streams (Q1633445) (← links)
- Revisiting key-alternating Feistel ciphers for shorter keys and multi-user security (Q1633451) (← links)
- The wonderful world of global random oracles (Q1648798) (← links)
- Non-interactive secure computation from one-way functions (Q1710666) (← links)
- A universally composable framework for the privacy of email ecosystems (Q1710670) (← links)
- On constant-round concurrent non-malleable proof systems (Q1944155) (← links)
- Everlasting multi-party computation (Q1994636) (← links)
- Signatures from sequential-OR proofs (Q2055653) (← links)
- Dynamic ad hoc clock synchronization (Q2056800) (← links)
- TARDIS: a foundation of time-lock puzzles in UC (Q2056801) (← links)
- Multiparty cardinality testing for threshold private intersection (Q2061947) (← links)
- Steel: composable hardware-based stateful and randomised functional encryption (Q2061984) (← links)
- Quantifying the security cost of migrating protocols to practice (Q2096478) (← links)
- Order-fairness for Byzantine consensus (Q2102076) (← links)
- P2DEX: privacy-preserving decentralized cryptocurrency exchange (Q2117034) (← links)
- Resource-restricted cryptography: revisiting MPC bounds in the proof-of-work era (Q2119009) (← links)
- Payment trees: low collateral payments for payment channel networks (Q2147242) (← links)
- UC-secure cryptographic reverse firewall-guarding corrupted systems with the minimum trusted module (Q2151289) (← links)
- Embedding the UC model into the IITM model (Q2170048) (← links)
- Feasibility and infeasibility of secure computation with malicious PUFs (Q2175217) (← links)
- Composable and finite computational security of quantum message transmission (Q2175915) (← links)
- The IITM model: a simple and expressive model for universal composability (Q2210435) (← links)
- Joint state composition theorems for public-key encryption and digital signature functionalities with local computation (Q2210436) (← links)
- Timed signatures and zero-knowledge proofs -- timestamping in the blockchain era (Q2229281) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- GNUC: a new universal composability framework (Q2516522) (← links)
- MPC with synchronous security and asynchronous responsiveness (Q2691582) (← links)
- Crowd verifiable zero-knowledge and end-to-end verifiable multiparty computation (Q2691603) (← 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)
- On the (Ir)replaceability of global setups, or how (not) to use a global ledger (Q2697878) (← links)
- Etherless Ethereum Tokens: simulating native tokens in Ethereum (Q2698288) (← links)
- Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions (Q2821797) (← links)
- Compact and Efficient UC Commitments Under Atomic-Exchanges (Q2942848) (← links)
- Universal Composition with Responsive Environments (Q2953797) (← links)
- A second note on the feasibility of generalized universal composability (Q3130297) (← 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)
- Concise Mercurial Vector Commitments and Independent Zero-Knowledge Sets with Short Proofs (Q3408212) (← links)
- Incoercible Multi-party Computation and Universally Composable Receipt-Free Voting (Q3457094) (← links)
