Oblivious transfer from weakly random self-reducible public-key cryptosystem

DOI10.1007/978-3-662-48054-0_22MaRDI QIDQ2946396zbMATH OpenOpenAlexFDO

Authors Claude Crépeau, Raza Ali Kazmi

Publication date 16 September 2015

Published in Mathematical Foundations of Computer Science 2015 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-48054-0_22

Mathematics Subject Classification ID

Cryptography (94A60)

Recommendations

• Oblivious-Transfer Amplification
• Weak oblivious transfer from strong one-way functions
• A Framework for Efficient and Composable Oblivious Transfer
• Oblivious Transfer Based on the McEliece Assumptions
• UC-secure OT from LWE, revisited

Cites work

• scientific article; zbMATH DE number 3856987 (Why is no real title available?)
• scientific article; zbMATH DE number 1186948 (Why is no real title available?)
• scientific article; zbMATH DE number 1030985 (Why is no real title available?)
• scientific article; zbMATH DE number 1852136 (Why is no real title available?)
• A Framework for Efficient and Composable Oblivious Transfer
• A method for obtaining digital signatures and public-key cryptosystems
• A public key cryptosystem and a signature scheme based on discrete logarithms
• A secure protocol for the oblivious transfer. (Extended abstract)
• A simple BGN-type cryptosystem from LWE
• Bit commitment using pseudorandomness
• Coding-Based Oblivious Transfer
• Efficient Fully Homomorphic Encryption from (Standard) LWE
• Foundations of Cryptography
• Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
• Fully homomorphic encryption from ring-LWE and security for key dependent messages
• Fully homomorphic encryption over the integers
• Fully homomorphic encryption using ideal lattices
• Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
• Oblivious Transfer Based on the McEliece Assumptions
• On lattices, learning with errors, random linear codes, and cryptography
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Probabilistic encryption
• Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
• Quantum Oblivious Transfer
• Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
• Statistically hiding commitments and statistical zero-knowledge arguments from any one-way function
• Zero-Knowledge Simulation of Boolean Circuits

Cited in

(2)

• Computational and Information Science
• A Weakness in Some Oblivious Transfer and Zero-Knowledge Protocols

This page was built for publication: Oblivious transfer from weakly random self-reducible public-key cryptosystem

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