Generic Construction of UC-Secure Oblivious Transfer

DOI10.1007/978-3-319-28166-7_4zbMath1459.94099OpenAlexW2293014871MaRDI QIDQ2794494

Céline Chevalier, Olivier Blazy

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

oblivious transfercommitmentssmooth projective hash functionsUC frameworkCCA encryption

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (5)

Adaptive Oblivious Transfer and Generalization ⋮ Structure-Preserving Smooth Projective Hashing ⋮ Generic Construction of UC-Secure Oblivious Transfer ⋮ Password-authenticated group key establishment from smooth projective hash functions ⋮ A gapless code-based hash proof system based on RQC and its applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generic Construction of UC-Secure Oblivious Transfer
• New Techniques for SPHFs and Efficient One-Round PAKE Protocols
• An Algebraic Framework for Diffie-Hellman Assumptions
• SPHF-Friendly Non-interactive Commitments
• Analysis and Improvement of Lindell’s UC-Secure Commitment Schemes
• Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller
• A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms
• Round-Optimal Password-Based Authenticated Key Exchange
• Highly-Efficient Universally-Composable Commitments Based on the DDH Assumption
• Non-interactive and Re-usable Universally Composable String Commitments with Adaptive Security
• Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
• Smooth Projective Hashing for Conditionally Extractable Commitments
• Bonsai Trees, or How to Delegate a Lattice Basis
• Universally composable two-party and multi-party secure computation
• A Framework for Efficient and Composable Oblivious Transfer
• Universally-Composable Two-Party Computation in Two Rounds
• Smooth Projective Hashing and Password-Based Authenticated Key Exchange from Lattices
• Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS
• Efficient UC-Secure Authenticated Key-Exchange for Algebraic Languages
• Smooth Projective Hashing and Two-Message Oblivious Transfer
• Pairing-Friendly Elliptic Curves of Prime Order

This page was built for publication: Generic Construction of UC-Secure Oblivious Transfer