Smooth Projective Hashing and Two-Message Oblivious Transfer
From MaRDI portal
Recommendations
Cited in
(38)- Constructing Universally Composable Oblivious Transfers from Double Trap-Door Encryptions
- A gapless code-based hash proof system based on RQC and its applications
- Revisited experimental comparison of node-link and matrix representations
- Fine-grained cryptography revisited
- Implementing Two-Party Computation Efficiently with Security Against Malicious Adversaries
- Smooth projective hashing and two-message oblivious transfer
- Multi-instance randomness extraction and security against bounded-storage mass surveillance
- Two-message statistically sender-private OT from LWE
- A black-box construction of fully-simulatable, round-optimal oblivious transfer from strongly uniform key agreement
- Oblivious Transfer Based on the McEliece Assumptions
- Structure-preserving smooth projective hashing
- An efficient protocol for secure two-party computation in the presence of malicious adversaries
- Communication-efficient distributed oblivious transfer
- Witness indistinguishability for any single-round argument with applications to access control
- Round Optimal Universally Composable Oblivious Transfer Protocols
- Blind Identity-Based Encryption and Simulatable Oblivious Transfer
- List oblivious transfer and applications to round-optimal black-box multiparty coin tossing
- Round-optimal black-box MPC in the plain model
- A framework for UC-secure commitments from publicly computable smooth projective hashing
- Statistical ZAP arguments
- Statistical Zaps and new oblivious transfer protocols
- A framework for witness encryption from linearly verifiable SNARKs and applications
- Adaptive oblivious transfer with access control from lattice assumptions
- Cryptographic reverse firewall via malleable smooth projective hash functions
- Channels of small log-ratio leakage and characterization of two-party differentially private computation
- Fair coin flipping: tighter analysis and the many-party case
- Efficient Fully-Simulatable Oblivious Transfer
- Security against covert adversaries: Efficient protocols for realistic adversaries
- Round-optimal black-box multiparty computation from polynomial-time assumptions
- Password-authenticated group key establishment from smooth projective hash functions
- Simpler statistically sender private oblivious transfer from ideals of cyclotomic integers
- Almost-optimally fair multiparty coin-tossing with nearly three-quarters malicious
- A gapless post-quantum hash proof system in the Hamming metric
- Rate-1 incompressible encryption from standard assumptions
- A new approach for UC security concurrent deniable authentication
- Generic construction of UC-secure oblivious transfer
- Adaptive oblivious transfer and generalization
- In search of mathematical primitives for deriving universal projective hash families
This page was built for publication: Smooth Projective Hashing and Two-Message Oblivious Transfer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5385723)
