Generic construction of UC-secure oblivious transfer

DOI10.1007/978-3-319-28166-7_4MaRDI QIDQ2794494zbMATH OpenOpenAlexFDO

Authors Olivier Blazy, Céline Chevalier

Publication date 10 March 2016

Published in Applied Cryptography and Network Security (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-28166-7_4

zbMATH Keywords

CCA encryptioncommitmentsoblivious transfersmooth projective hash functionsUC framework

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Efficient adaptive oblivious transfer without q-type assumptions in UC framework
• UC-secure OT from LWE, revisited
• Universally composable oblivious transfer from lossy encryption and the MceEliece assumptions
• Efficient Composable Oblivious Transfer from CDH in the Global Random Oracle Model
• Smooth projective hashing and two-message oblivious transfer

Cites work

• A Framework for Efficient and Composable Oblivious Transfer
• A public key cryptosystem and a signature scheme based on discrete logarithms
• An algebraic framework for Diffie-Hellman assumptions
• Analysis and improvement of Lindell's UC-secure commitment schemes
• Bonsai trees, or how to delegate a lattice basis
• Efficient oblivious transfer protocols
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Efficient, adaptively secure, and composable oblivious transfer with a single, global CRS
• Generic construction of UC-secure oblivious transfer
• Highly-efficient universally-composable commitments based on the DDH assumption
• scientific article; zbMATH DE number 176545 (Why is no real title available?)
• scientific article; zbMATH DE number 1942445 (Why is no real title available?)
• scientific article; zbMATH DE number 2009978 (Why is no real title available?)
• scientific article; zbMATH DE number 2086698 (Why is no real title available?)
• scientific article; zbMATH DE number 1842484 (Why is no real title available?)
• New techniques for SPHFs and efficient one-round PAKE protocols
• Non-interactive and re-usable universally composable string commitments with adaptive security
• Pairing-Friendly Elliptic Curves of Prime Order
• Round-optimal password-based authenticated key exchange
• Smooth projective hashing and password-based authenticated key exchange from lattices
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• SPHF-friendly non-interactive commitments
• Trapdoors for lattices: simpler, tighter, faster, smaller
• Universally composable two-party and multi-party secure computation
• Universally-Composable Two-Party Computation in Two Rounds

Cited in

(7)

• A gapless code-based hash proof system based on RQC and its applications
• UC-secure OT from LWE, revisited
• Password-authenticated group key establishment from smooth projective hash functions
• Generic construction of UC-secure oblivious transfer
• Adaptive oblivious transfer and generalization
• Structure-preserving smooth projective hashing
• Almost optimal oblivious transfer from QA-NIZK

This page was built for publication: Generic construction of UC-secure oblivious transfer

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2794494)