Pages that link to "Item:Q983160"
From MaRDI portal
The following pages link to Efficient secure two-party protocols. Techniques and constructions (Q983160):
Displayed 45 items.
- Automata evaluation and text search protocols with simulation-based security (Q290379) (← links)
- Fast cut-and-choose-based protocols for malicious and covert adversaries (Q290398) (← links)
- An optimally fair coin toss (Q315542) (← links)
- Adaptive zero-knowledge proofs and adaptively secure oblivious transfer (Q656920) (← links)
- Computationally secure pattern matching in the presence of malicious adversaries (Q744607) (← links)
- Non-interactive half-aggregation of EdDSA and variants of Schnorr signatures (Q826296) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Program synthesis for interactive-security systems (Q1696589) (← links)
- Privacy preserving distributed optimization using homomorphic encryption (Q1716476) (← links)
- Oblivious polynomial evaluation and secure set-intersection from algebraic PRFs (Q1753171) (← links)
- Efficient and secure outsourced approximate pattern matching protocol (Q1797787) (← links)
- Secure two-party computation via cut-and-choose oblivious transfer (Q1928765) (← links)
- Oblivious DFA evaluation on joint input and its applications (Q2023228) (← links)
- Secure extended wildcard pattern matching protocol from cut-and-choose oblivious transfer (Q2023253) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Security of hedged Fiat-Shamir signatures under fault attacks (Q2055633) (← links)
- Compact, efficient and UC-secure isogeny-based oblivious transfer (Q2056684) (← links)
- An improvement of multi-exponentiation with encrypted bases argument: smaller and faster (Q2057167) (← links)
- Black-box transformations from passive to covert security with public verifiability (Q2096543) (← links)
- A compressed \(\varSigma \)-protocol theory for lattices (Q2128575) (← links)
- Generic plaintext equality and inequality proofs (Q2145406) (← links)
- How (not) to achieve both coercion resistance and cast as intended verifiability in remote evoting (Q2149844) (← links)
- A simple post-quantum non-interactive zero-knowledge proof from garbled circuits (Q2151307) (← links)
- Improved zero-knowledge argument of encrypted extended permutation (Q2151308) (← links)
- Cryptographic reverse firewalls for interactive proof systems (Q2220883) (← links)
- Efficient RSA key generation and threshold Paillier in the two-party setting (Q2423838) (← links)
- Secure parameterized pattern matching (Q2663480) (← links)
- The Simplest Protocol for Oblivious Transfer (Q2946440) (← links)
- A Multi-Party Protocol for Privacy-Preserving Cooperative Linear Systems of Equations (Q2947113) (← links)
- Efficient and Secure Generalized Pattern Matching via Fast Fourier Transform (Q3011902) (← links)
- Efficient Multi-party Computation: From Passive to Active Security via Secure SIMD Circuits (Q3457092) (← links)
- How to Simulate It – A Tutorial on the Simulation Proof Technique (Q5021134) (← links)
- Hierarchical and dynamic threshold Paillier cryptosystem without trusted dealer (Q5025956) (← links)
- Making Private Function Evaluation Safer, Faster, and Simpler (Q5087263) (← links)
- From fairness to full security in multiparty computation (Q5916285) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- Fast secure two-party ECDSA signing (Q5918379) (← links)
- Secure two-party input-size reduction: challenges, solutions and applications (Q6081302) (← links)
- Actively secure garbled circuits with constant communication overhead in the plain model (Q6109074) (← links)
- Lattice-based signatures with tight adaptive corruptions and more (Q6113962) (← links)
- Achievable \textsf{CCA2} relaxation for homomorphic encryption (Q6114265) (← links)
- Fast two-party signature for upgrading ECDSA to two-party scenario easily (Q6138829) (← links)
- Brakedown: linear-time and field-agnostic SNARKs for R1CS (Q6145784) (← links)
- Parallel repetition of \((k_1,\dots ,k_{\mu }) \)-special-sound multi-round interactive proofs (Q6155262) (← links)
- Half-tree: halving the cost of tree expansion in COT and DPF (Q6178790) (← links)
