Pages that link to "Item:Q2458940"
From MaRDI portal
The following pages link to Computationally private randomizing polynomials and their applications (Q2458940):
Displaying 43 items.
- Garbling XOR gates ``for free'' in the standard model (Q315547) (← links)
- Cryptographic hardness of random local functions. Survey (Q332271) (← links)
- On \(d\)-multiplicative secret sharing (Q604627) (← links)
- Key-dependent message security: generic amplification and completeness (Q744344) (← links)
- Cryptography with constant input locality (Q1037233) (← links)
- Perfect secure computation in two rounds (Q1629404) (← links)
- Round optimal black-box ``commit-and-prove'' (Q1629413) (← links)
- Impossibility of simulation secure functional encryption even with random oracles (Q1629443) (← links)
- Succinct garbling schemes from functional encryption through a local simulation paradigm (Q1631342) (← links)
- Tweakable block ciphers secure beyond the birthday bound in the ideal cipher model (Q1633458) (← links)
- Homomorphic secret sharing for low degree polynomials (Q1710675) (← links)
- Multi-party threshold private set intersection with sublinear communication (Q2061962) (← links)
- Versatile and sustainable timed-release encryption and sequential time-lock puzzles (extended abstract) (Q2148748) (← links)
- From FE combiners to secure MPC and back (Q2175912) (← links)
- On the relationship between statistical zero-knowledge and statistical randomized encodings (Q2281251) (← links)
- Locally computable UOWHF with linear shrinkage (Q2408584) (← links)
- Two-round maliciously secure computation with super-polynomial simulation (Q2695653) (← links)
- On actively-secure elementary MPC reductions (Q2695655) (← links)
- Indistinguishability Obfuscation: From Approximate to Exact (Q2796119) (← links)
- Output-Compressing Randomized Encodings and Applications (Q2796121) (← links)
- Functional Encryption for Turing Machines (Q2796122) (← links)
- Verifiable Pattern Matching on Outsourced Texts (Q2827727) (← links)
- Adaptively Secure Garbled Circuits from One-Way Functions (Q2829946) (← links)
- Fully Secure Functional Encryption for Inner Products, from Standard Assumptions (Q2829952) (← links)
- On the Relationship Between Statistical Zero-Knowledge and Statistical Randomized Encodings (Q2829956) (← links)
- Encoding Functions with Constant Online Rate, or How to Compress Garbled Circuit Keys (Q2954373) (← links)
- A Framework with Randomized Encoding for a Fast Privacy Preserving Calculation of Non-linear Kernels for Machine Learning Applications in Precision Medicine (Q3297645) (← links)
- Statistical Randomized Encodings: A Complexity Theoretic View (Q3448769) (← links)
- Indistinguishability Obfuscation from Compact Functional Encryption (Q3457116) (← links)
- Indistinguishability Obfuscation for RAM Programs and Succinct Randomized Encodings (Q4571930) (← links)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- Garbled Circuits as Randomized Encodings of Functions: a Primer (Q5021129) (← links)
- Reusable Two-Round MPC from LPN (Q5087256) (← links)
- Perfect Secure Computation in Two Rounds (Q5149757) (← links)
- Bounded-Collusion Attribute-Based Encryption from Minimal Assumptions (Q5738752) (← links)
- Better Two-Round Adaptive Multi-party Computation (Q5738763) (← links)
- Projective Arithmetic Functional Encryption and Indistinguishability Obfuscation from Degree-5 Multilinear Maps (Q5738874) (← links)
- Functional Encryption: Deterministic to Randomized Functions from Simple Assumptions (Q5738969) (← links)
- Group-Based Secure Computation: Optimizing Rounds, Communication, and Computation (Q5738973) (← links)
- Round-optimal secure multi-party computation (Q5918346) (← links)
- Simple and generic constructions of succinct functional encryption (Q5918349) (← links)
- Obfustopia built on secret-key functional encryption (Q5925547) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
