Computationally private randomizing polynomials and their applications
From MaRDI portal
Recommendations
Cited in
(54)- mrNISC from LWE with polynomial modulus
- On \(d\)-multiplicative secret sharing
- Reusable two-round MPC from LPN
- Encrypted polynomial control based on tailored two‐party computation
- Private Computations over the Integers
- On pseudorandom encodings
- On actively-secure elementary MPC reductions
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- On the relationship between statistical zero-knowledge and statistical randomized encodings
- Fully secure functional encryption for inner products, from standard assumptions
- Impossibility of simulation secure functional encryption even with random oracles
- Perfect secure computation in two rounds
- Round optimal black-box ``commit-and-prove
- Succinct garbling schemes from functional encryption through a local simulation paradigm
- Round-optimal secure multi-party computation
- Perfect secure computation in two rounds
- Indistinguishability obfuscation from compact functional encryption
- Quadratic multiparty randomized encodings beyond honest majority and their applications
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model
- Output-compressing randomized encodings and applications
- 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
- Verifiable pattern matching on outsourced texts
- Foundations of homomorphic secret sharing
- Garbled circuits as randomized encodings of functions: a primer
- Functional Encryption for Turing Machines
- Statistical randomized encodings: a complexity theoretic view
- Garbling XOR gates ``for free in the standard model
- Simple and generic constructions of succinct functional encryption
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract)
- Key-dependent message security: generic amplification and completeness
- An Efficient and Provably Secure Private Polynomial Evaluation Scheme
- scientific article; zbMATH DE number 176508 (Why is no real title available?)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings
- Private computation of polynomials over networks
- Cryptography in $NC^0$
- Cryptographic hardness of random local functions. Survey
- Cryptography with constant input locality
- Functional encryption: deterministic to randomized functions from simple assumptions
- Obfustopia built on secret-key functional encryption
- From FE combiners to secure MPC and back
- Multi-party threshold private set intersection with sublinear communication
- Randomly encoding functions: a new cryptographic paradigm. (Invited talk)
- Locally computable UOWHF with linear shrinkage
- Minimizing locality of one-way functions via semi-private randomized encodings
- Two-round maliciously secure computation with super-polynomial simulation
- Indistinguishability obfuscation: from approximate to exact
- mrNISC from LWE with polynomial modulus
- Encoding functions with constant online rate, or how to compress garbled circuit keys
- Adaptively secure garbled circuits from one-way functions
- Homomorphic secret sharing for low degree polynomials
- A framework with randomized encoding for a fast privacy preserving calculation of non-linear kernels for machine learning applications in precision medicine
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation
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)
