Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem
From MaRDI portal
Publication:2946396
DOI10.1007/978-3-662-48054-0_22zbMath1465.94062OpenAlexW2394678233MaRDI QIDQ2946396
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
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Bit commitment using pseudorandomness
- Probabilistic encryption
- A secure protocol for the oblivious transfer. (Extended abstract)
- Fully Homomorphic Encryption over the Integers
- A Simple BGN-Type Cryptosystem from LWE
- Statistically Hiding Commitments and Statistical Zero-Knowledge Arguments from Any One-Way Function
- Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
- A Framework for Efficient and Composable Oblivious Transfer
- A public key cryptosystem and a signature scheme based on discrete logarithms
- Zero-Knowledge Simulation of Boolean Circuits
- A method for obtaining digital signatures and public-key cryptosystems
- Public-Key Cryptosystems Based on Composite Degree Residuosity Classes
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum Oblivious Transfer
- Foundations of Cryptography
- Fully homomorphic encryption using ideal lattices
- Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
- Semi-honest to Malicious Oblivious Transfer—The Black-Box Way
- Efficient Fully Homomorphic Encryption from (Standard) LWE
- Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits
- Oblivious Transfer Based on the McEliece Assumptions
- Coding-Based Oblivious Transfer
- On lattices, learning with errors, random linear codes, and cryptography
This page was built for publication: Oblivious Transfer from Weakly Random Self-Reducible Public-Key Cryptosystem
