Computationally private randomizing polynomials and their applications
From MaRDI portal
Publication:2458940
DOI10.1007/s00037-006-0211-8zbMath1143.94009OpenAlexW2138532540MaRDI QIDQ2458940
Benny Applebaum, Eyal Kushilevitz, Yuval Ishai
Publication date: 5 November 2007
Published in: Computational Complexity (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00037-006-0211-8
randomized encodingcomputationally private encodingEPRG assumptionparallel time complexity of cryptographic primitives
Cryptography (94A60) Complexity classes (hierarchies, relations among complexity classes, etc.) (68Q15)
Related Items (44)
Perfect secure computation in two rounds ⋮ Round optimal black-box ``commit-and-prove ⋮ Impossibility of simulation secure functional encryption even with random oracles ⋮ Statistical Randomized Encodings: A Complexity Theoretic View ⋮ Succinct garbling schemes from functional encryption through a local simulation paradigm ⋮ Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model ⋮ Garbling XOR gates ``for free in the standard model ⋮ Indistinguishability Obfuscation from Compact Functional Encryption ⋮ Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) ⋮ Cryptographic hardness of random local functions. Survey ⋮ Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings ⋮ Reusable Two-Round MPC from LPN ⋮ From FE combiners to secure MPC and back ⋮ On \(d\)-multiplicative secret sharing ⋮ Locally computable UOWHF with linear shrinkage ⋮ Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys ⋮ mrNISC from LWE with polynomial modulus ⋮ mrNISC from LWE with polynomial modulus ⋮ Two-round maliciously secure computation with super-polynomial simulation ⋮ On actively-secure elementary MPC reductions ⋮ Homomorphic secret sharing for low degree polynomials ⋮ Foundations of Homomorphic Secret Sharing ⋮ A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine ⋮ Perfect Secure Computation in Two Rounds ⋮ Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions ⋮ Better Two-Round Adaptive Multi-party Computation ⋮ Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps ⋮ Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions ⋮ Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation ⋮ On the relationship between statistical zero-knowledge and statistical randomized encodings ⋮ Simple and generic constructions of succinct functional encryption ⋮ Indistinguishability Obfuscation: From Approximate to Exact ⋮ Output-Compressing Randomized Encodings and Applications ⋮ Functional Encryption for Turing Machines ⋮ Round-optimal secure multi-party computation ⋮ Obfustopia built on secret-key functional encryption ⋮ Key-dependent message security: generic amplification and completeness ⋮ Multi-party threshold private set intersection with sublinear communication ⋮ Verifiable Pattern Matching on Outsourced Texts ⋮ Adaptively Secure Garbled Circuits from One-Way Functions ⋮ Fully Secure Functional Encryption for Inner Products, from Standard Assumptions ⋮ On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings ⋮ Cryptography with constant input locality ⋮ Garbled Circuits as Randomized Encodings of Functions: a Primer
This page was built for publication: Computationally private randomizing polynomials and their applications
