Breaking the Circuit Size Barrier for Secure Computation Under Quasi-Polynomial LPN
Geoffroy Couteau, Pierre Meyer
Topics & Concepts
Pseudorandom number generatorMathematicsDiscrete mathematicsPolynomialComputationSecure multi-party computationBinary logarithmBoolean circuitCommunication complexitySecurity parameterHomomorphic encryptionCombinatoricsLearning with errorsAlgorithmBoolean functionComputer scienceEncryptionCryptographyMathematical analysisOperating systemCryptography and Data SecurityComplexity and Algorithms in GraphsPrivacy-Preserving Technologies in Data