Pages that link to "Item:Q4250753"
From MaRDI portal
The following pages link to On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions (Q4250753):
Displaying 22 items.
- A light-weight bit commitment protocol based on unpredictable channel noise (Q1725688) (← links)
- Formalising \(\varSigma\)-protocols and commitment schemes using crypthol (Q2031427) (← links)
- Amplifying the security of functional encryption, unconditionally (Q2096505) (← links)
- Secure computation from one-way noisy communication, or: anti-correlation via anti-concentration (Q2128558) (← links)
- Unclonable polymers and their cryptographic applications (Q2170032) (← links)
- Basing cryptographic protocols on tamper-evident seals (Q2268101) (← links)
- Cryptography from one-way communication: on completeness of finite channels (Q2691601) (← links)
- Network Oblivious Transfer (Q2829221) (← links)
- Secure Two-Party Computation over a Z-Channel (Q3092345) (← links)
- Bit Commitment in the Bounded Storage Model: Tight Bound and Simple Optimal Construction (Q3104689) (← links)
- Oblivious Transfer from Any Non-trivial Elastic Noisy Channel via Secret Key Agreement (Q3179358) (← links)
- Error-Tolerant Combiners for Oblivious Primitives (Q3519523) (← links)
- Polling with Physical Envelopes: A Rigorous Analysis of a Human-Centric Protocol (Q3593091) (← links)
- OT-Combiners via Secure Computation (Q5445517) (← links)
- Degradation and Amplification of Computational Hardness (Q5445529) (← links)
- David and Goliath Commitments: UC Computation for Asymmetric Parties Using Tamper-Proof Hardware (Q5458612) (← links)
- A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols (Q5459089) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Topics in Cryptology – CT-RSA 2004 (Q5901694) (← links)
- Theory of Cryptography (Q5901781) (← links)
- A tight computational indistinguishability bound for product distributions (Q6114275) (← links)
- Amplification of non-interactive zero knowledge, revisited (Q6653051) (← links)
