Pages that link to "Item:Q2458940"
From MaRDI portal
The following pages link to Computationally private randomizing polynomials and their applications (Q2458940):
Displaying 13 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)
- Foundations of Homomorphic Secret Sharing (Q4993284) (← links)
- mrNISC from LWE with polynomial modulus (Q6116180) (← links)
