Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions

DOI10.1007/978-3-642-32284-6_5zbMath1295.94048OpenAlexW92151606MaRDI QIDQ5200456

Jörn Müller-Quade, Anderson C. A. Nascimento, Bernardo David

Publication date: 6 November 2012

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-32284-6_5

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items (4)

Round-optimal oblivious transfer and MPC from computational CSIDH ⋮ Compact, efficient and UC-secure isogeny-based oblivious transfer ⋮ On black-box complexity of universally composable security in the CRS model ⋮ Efficient and tight oblivious transfer from PKE with tight multi-user security

This page was built for publication: Universally Composable Oblivious Transfer from Lossy Encryption and the McEliece Assumptions