Pages that link to "Item:Q3579187"
From MaRDI portal
The following pages link to Universally composable two-party and multi-party secure computation (Q3579187):
Displaying 50 items.
- Impossibility results for universal composability in public-key models and with fixed inputs (Q451115) (← links)
- Spin-the-bottle sort and annealing sort: oblivious sorting via round-robin random comparisons (Q476439) (← links)
- A novel protocol for multiparty quantum key management (Q496910) (← links)
- Quantum private comparison over noisy channels (Q496932) (← links)
- A full proof of the BGW protocol for perfectly secure multiparty computation (Q514468) (← 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)
- 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)
- Analyzing security protocols using time-bounded task-PIOAs (Q1020557) (← 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)
- Round-optimal fully black-box zero-knowledge arguments from one-way permutations (Q1629411) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- An improved affine equivalence algorithm for random permutations (Q1648807) (← links)
- Round-efficient black-box construction of composable multi-party computation (Q1715857) (← links)
- All-but-many encryption (Q1747665) (← 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)
- Round-preserving parallel composition of probabilistic-termination cryptographic protocols (Q2035999) (← links)
- Topology-hiding computation for networks with unknown delays (Q2055692) (← links)
- Function secret sharing for mixed-mode and fixed-point secure computation (Q2056774) (← links)
- Towards accountability in CRS generation (Q2056795) (← links)
- Abuse resistant law enforcement access systems (Q2056806) (← links)
- Shorter lattice-based zero-knowledge proofs via one-time commitments (Q2061919) (← links)
- Round-optimal black-box commit-and-prove with succinct communication (Q2096539) (← links)
- Two-round oblivious transfer from CDH or LPN (Q2119032) (← links)
- On the concurrent composition of quantum zero-knowledge (Q2120082) (← links)
- Constant-round leakage-resilient zero-knowledge from collision resistance (Q2135523) (← links)
- Signatures of knowledge for Boolean circuits under standard assumptions (Q2143135) (← links)
- Zero-knowledge proofs for set membership: efficient, succinct, modular (Q2145404) (← links)
- Another look at extraction and randomization of Groth's zk-SNARK (Q2145409) (← links)
- Subversion-resistant quasi-adaptive NIZK and applications to modular zk-SNARKs (Q2149845) (← links)
- On black-box extension of a non-interactive zero-knowledge proof system for secret equality (Q2152072) (← links)
- Pribank: confidential blockchain scaling using short commit-and-proof NIZK argument (Q2152182) (← links)
- Everlasting UC commitments from fully malicious PUFs (Q2155992) (← links)
- Universally composable subversion-resilient cryptography (Q2170002) (← links)
- Practical non-interactive publicly verifiable secret sharing with thousands of parties (Q2170010) (← links)
- Adaptively secure computation for RAM programs (Q2170045) (← links)
- UC priced oblivious transfer with purchase statistics and dynamic pricing (Q2179394) (← links)
- On the power of secure two-party computation (Q2303458) (← links)
- On black-box complexity of universally composable security in the CRS model (Q2318086) (← links)
- Probabilistic termination and composability of cryptographic protocols (Q2318087) (← links)
- (Efficient) universally composable oblivious transfer using a minimal number of stateless tokens (Q2423844) (← links)
