Computationally private randomizing polynomials and their applications
In the paper a variant of the notion of \textit{randomized encoding} of a function is studied. Namely, \textit{computationally private} randomized encodings are introduced and used to investigate whether every polynomial-time computable function can be encoded by an \(NC^0\) function. As a main result it is shown how to construct a computationally private encoding in \(NC^0\) for every polynomial-time computable function, assuming the existence of `easy'- cryptographic pseudorandom generator (one that stretches its seed by just one bit) in uniform \(\bigoplus L/poly\). Using this construction, the authors are able to get some other interesting results. They show that the existence of various cryptographic primitives in \(NC^0\) follows from the EPRG assumption (i.e. an `easy'-cryptographic pseudorandom generator exists in uniform \(\bigoplus L/poly\)). Other application of the technique led to new parallel reductions between cryptographic primitives and new constant-round protocols for multiparty computations.
- Cryptography with constant input locality
- Perfect secure computation in two rounds
- Round optimal black-box ``commit-and-prove
- Impossibility of simulation secure functional encryption even with random oracles
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Homomorphic secret sharing for low degree polynomials
- Minimizing locality of one-way functions via semi-private randomized encodings
- Multi-party threshold private set intersection with sublinear communication
- On pseudorandom encodings
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Private computation of polynomials over networks
- From FE combiners to secure MPC and back
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Locally computable UOWHF with linear shrinkage
- Two-round maliciously secure computation with super-polynomial simulation
- On actively-secure elementary MPC reductions
- Indistinguishability obfuscation: from approximate to exact
- Output-compressing randomized encodings and applications
- Functional Encryption for Turing Machines
- 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
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Garbling XOR gates ``for free in the standard model
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
- Cryptographic hardness of random local functions. Survey
- Statistical randomized encodings: a complexity theoretic view
- Indistinguishability obfuscation from compact functional encryption
- scientific article; zbMATH DE number 176508 (Why is no real title available?)
- scientific article; zbMATH DE number 1256767 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Private Computations over the Integers
- Encrypted polynomial control based on tailored two‐party computation
- Foundations of homomorphic secret sharing
- Garbled circuits as randomized encodings of functions: a primer
- Reusable two-round MPC from LPN
- 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
- Cryptography in NC^0
- Round-optimal secure multi-party computation
- Simple and generic constructions of succinct functional encryption
- Obfustopia built on secret-key functional encryption
- On \(d\)-multiplicative secret sharing
- mrNISC from LWE with polynomial modulus
- mrNISC from LWE with polynomial modulus
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Full-grained proxy re-encryption for all circuits
- Pseudorandom strings from pseudorandom quantum states
- Multi-authority functional encryption with bounded collusions from standard assumptions
- Bounded collusion-resistant registered functional encryption for circuits
- Succinct garbled circuits with low-depth garbling algorithms
- Certified everlasting secure collusion-resistant functional encryption, and more
- Key-dependent message security: generic amplification and completeness
This page was built for publication: Computationally private randomizing polynomials and their applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2458940)
