Pages that link to "Item:Q1402368"
From MaRDI portal
The following pages link to Parallel coin-tossing and constant-round secure two-party computation (Q1402368):
Displaying 33 items.
- Concurrent knowledge extraction in public-key models (Q271592) (← links)
- An optimally fair coin toss (Q315542) (← links)
- A note on constant-round zero-knowledge proofs of knowledge (Q380963) (← links)
- A verifiable secret shuffle of homomorphic encryptions (Q604630) (← links)
- A note on universal composable zero-knowledge in the common reference string model (Q1007253) (← links)
- Handling expected polynomial-time strategies in simulation-based security proofs (Q1021232) (← links)
- Reducing complexity assumptions for statistically-hiding commitment (Q1027978) (← links)
- Delayed-input non-malleable zero knowledge and multi-party coin tossing in four rounds (Q1690213) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- SPARKs: succinct parallelizable arguments of knowledge (Q2055636) (← links)
- Post-quantum multi-party computation (Q2056694) (← links)
- Efficient range proofs with transparent setup from bounded integer commitments (Q2056793) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Compressed \(\varSigma\)-protocol theory and practical application to plug \& play secure algorithmics (Q2102078) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Compressing proofs of \(k\)-out-of-\(n\) partial knowledge (Q2139628) (← links)
- Time- and space-efficient arguments from groups of unknown order (Q2139631) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- A new interactive hashing theorem (Q2442643) (← links)
- Protocols for multiparty coin toss with a dishonest majority (Q2516525) (← links)
- An optimized inner product argument with more application scenarios (Q2673065) (← links)
- On the (Im-)Possibility of Extending Coin Toss (Q3593114) (← links)
- Finding Collisions in Interactive Protocols---Tight Lower Bounds on the Round and Communication Complexities of Statistically Hiding Commitments (Q5252662) (← links)
- Advances in Cryptology – CRYPTO 2004 (Q5311543) (← links)
- Efficient Protocols for Set Intersection and Pattern Matching with Security Against Malicious and Covert Adversaries (Q5445504) (← links)
- Efficient protocols for set intersection and pattern matching with security against malicious and covert adversaries (Q5962221) (← links)
- Compressed $$\varSigma $$-Protocols for Bilinear Group Arithmetic Circuits and Application to Logarithmic Transparent Threshold Signatures (Q6041296) (← links)
- Efficient transparent polynomial commitments for zk-SNARKs (Q6558604) (← links)
- Distributed-prover interactive proofs (Q6581784) (← links)
- Public-coin, complexity-preserving, succinct arguments of knowledge for NP from collision-resistance (Q6637522) (← links)
- Constant-round simulation-secure coin tossing extension with guaranteed output (Q6637540) (← links)
- Bulletproofs++: next generation confidential transactions via reciprocal set membership arguments (Q6637547) (← links)
- On soundness notions for interactive oracle proofs (Q6655868) (← links)
