Pages that link to "Item:Q5385723"
From MaRDI portal
The following pages link to Smooth Projective Hashing and Two-Message Oblivious Transfer (Q5385723):
Displaying 31 items.
- Communication-efficient distributed oblivious transfer (Q439979) (← links)
- Two-message statistically sender-private OT from LWE (Q1631337) (← links)
- Statistical ZAP arguments (Q2055672) (← links)
- Statistical Zaps and new oblivious transfer protocols (Q2055674) (← links)
- Witness indistinguishability for any single-round argument with applications to access control (Q2055687) (← links)
- A gapless code-based hash proof system based on RQC and its applications (Q2099170) (← links)
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement (Q2175906) (← links)
- Channels of small log-ratio leakage and characterization of two-party differentially private computation (Q2175926) (← links)
- Security against covert adversaries: Efficient protocols for realistic adversaries (Q2267365) (← links)
- Password-authenticated group key establishment from smooth projective hash functions (Q2299203) (← links)
- An efficient protocol for secure two-party computation in the presence of malicious adversaries (Q2344051) (← links)
- In search of mathematical primitives for deriving universal projective hash families (Q2426956) (← links)
- A new approach for UC security concurrent deniable authentication (Q2519285) (← links)
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers (Q2692389) (← links)
- Generic Construction of UC-Secure Oblivious Transfer (Q2794494) (← links)
- Adaptive Oblivious Transfer and Generalization (Q2953778) (← links)
- Structure-Preserving Smooth Projective Hashing (Q2953782) (← links)
- An Almost-Optimally Fair Three-Party Coin-Flipping Protocol (Q2968163) (← links)
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries (Q3540034) (← links)
- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions (Q3637148) (← links)
- Revisited Experimental Comparison of Node-Link and Matrix Representations (Q4625118) (← links)
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer (Q5387104) (← links)
- Efficient Fully-Simulatable Oblivious Transfer (Q5458932) (← links)
- Oblivious Transfer Based on the McEliece Assumptions (Q5502796) (← links)
- Round Optimal Universally Composable Oblivious Transfer Protocols (Q5505480) (← links)
- Fine-grained cryptography revisited (Q5918348) (← links)
- Adaptive oblivious transfer with access control from lattice assumptions (Q5919120) (← links)
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious (Q6109072) (← links)
- Rate-1 incompressible encryption from standard assumptions (Q6114264) (← links)
- Round-optimal black-box MPC in the plain model (Q6186598) (← links)
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing (Q6186600) (← links)