Efficient pseudorandom correlation generators from ring-LPN
type: Item
instance of: scholarly article
title: Efficient pseudorandom correlation generators from ring-LPN
zbMATH Open document ID: 1501.94033
DOI: 10.1007/978-3-030-56880-1_14
author: Elette Boyle
author: Geoffroy Couteau
author: Niv Gilboa
author: Yuval Ishai
author: Lisa Kohl
author: Peter Scholl
publication date: 2022-11-09T00:00:00Z
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 7614574
zbMATH Keywords: secure multiparty computation
describes a project that uses: NFLlib
describes a project that uses: ring-LWE
MaRDI profile type: Publication
full work available at URL: 978-3-030-56880-1 14
OpenAlex ID: W3048468015
cites work: NFLlib: NTT-Based Fast Lattice Library
cites work: Fast Cryptographic Primitives and Circular-Secure Encryption Based on Hard Learning Problems
cites work: Q4035736
cites work: Turbospeedz: double your online SPDZ! Improving SPDZ using function dependent preprocessing
cites work: Semi-homomorphic Encryption and Multiparty Computation
cites work: Never Trust a Bunny
cites work: Q4341754
cites work: Efficient pseudorandom correlation generators: silent OT extension and more
cites work: Function Secret Sharing
cites work: Breaking the Circuit Size Barrier for Secure Computation Under DDH
cites work: Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
cites work: Secure computation with preprocessing via function secret sharing
cites work: Homomorphic secret sharing from lattices without FHE
cites work: Efficient Fully Homomorphic Encryption from (Standard) LWE
cites work: Fully Homomorphic Encryption from Ring-LWE and Security for Key Dependent Messages
cites work: A note on the communication complexity of multiparty computation in the correlated randomness model
cites work: Practical Covertly Secure MPC for Dishonest Majority – Or: Breaking the SPDZ Limits
cites work: The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
cites work: Multiparty Computation from Somewhat Homomorphic Encryption
cites work: Distributed Point Functions and Their Applications
cites work: A New Algorithm for Solving Ring-LPN With a Reducible Polynomial
cites work: Lapin: An Efficient Authentication Protocol Based on Ring-LPN
cites work: On the Power of Correlated Randomness in Secure Computation
cites work: Batch codes and their applications
cites work: Founding Cryptography on Oblivious Transfer – Efficiently
cites work: Secure Arithmetic Computation with No Honest Majority
cites work: Overdrive: making SPDZ great again
cites work: Improved Garbled Circuit Building Blocks and Applications to Auctions and Computing Minima
cites work: A Toolkit for Ring-LWE Cryptography
cites work: Efficient Encryption From Random Quasi-Cyclic Codes
cites work: Oblivious transfer and polynomial evaluation
cites work: A New Approach to Practical Active-Secure Two-Party Computation
cites work: On lattices, learning with errors, random linear codes, and cryptography
cites work: Fully homomorphic SIMD operations
description: scientific article; zbMATH DE number 7614574