Smooth Projective Hashing and Two-Message Oblivious Transfer
From MaRDI portal
Publication:5385723
DOI10.1007/11426639_5zbMath1137.94348OpenAlexW1513096110MaRDI QIDQ5385723
Publication date: 6 May 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11426639_5
Related Items (31)
Two-message statistically sender-private OT from LWE ⋮ A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement ⋮ Channels of small log-ratio leakage and characterization of two-party differentially private computation ⋮ Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious ⋮ Rate-1 incompressible encryption from standard assumptions ⋮ In search of mathematical primitives for deriving universal projective hash families ⋮ Round-optimal black-box MPC in the plain model ⋮ List oblivious transfer and applications to round-optimal black-box multiparty coin tossing ⋮ Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers ⋮ An Almost-Optimally Fair Three-Party Coin-Flipping Protocol ⋮ Communication-efficient distributed oblivious transfer ⋮ Revisited Experimental Comparison of Node-Link and Matrix Representations ⋮ Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries ⋮ Blind Identity-Based Encryption and Simulatable Oblivious Transfer ⋮ Security against covert adversaries: Efficient protocols for realistic adversaries ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Fine-grained cryptography revisited ⋮ Efficient Fully-Simulatable Oblivious Transfer ⋮ A new approach for UC security concurrent deniable authentication ⋮ Adaptive oblivious transfer with access control from lattice assumptions ⋮ Password-authenticated group key establishment from smooth projective hash functions ⋮ Statistical ZAP arguments ⋮ Statistical Zaps and new oblivious transfer protocols ⋮ Witness indistinguishability for any single-round argument with applications to access control ⋮ Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions ⋮ Oblivious Transfer Based on the McEliece Assumptions ⋮ Round Optimal Universally Composable Oblivious Transfer Protocols ⋮ A gapless code-based hash proof system based on RQC and its applications ⋮ An efficient protocol for secure two-party computation in the presence of malicious adversaries
This page was built for publication: Smooth Projective Hashing and Two-Message Oblivious Transfer
