Mix and match: Secure function evaluation via ciphertexts. (Extended abstract)
From MaRDI portal
Recommendations
- Function secret sharing for mixed-mode and fixed-point secure computation
- A unified characterization of completeness and triviality for secure function evaluation
- Multi-input functional encryption in the private-key setting: stronger security from weaker assumptions
- Multi-input Functional Encryption in the Private-Key Setting: Stronger Security from Weaker Assumptions
- Rate-limited secure function evaluation: definitions and constructions
- Functional encryption: deterministic to randomized functions from simple assumptions
- A tighter proof for CCA secure inner product functional encryption: genericity meets efficiency
- Private functional encryption: indistinguishability-based definitions and constructions from obfuscation
- Combiners for functional encryption, unconditionally
Cited in
(13)- Secret, verifiable auctions from elections
- Polynomial expressions of \(p\)-ary auction functions
- Generic plaintext equality and inequality proofs
- Secure rational numbers equivalence test based on threshold cryptosystem with rational numbers
- Computer science and decision theory
- Absentia: secure multiparty computation on ethereum
- A secure \(M + 1^{\text{st}}\) price auction protocol based on bit slice circuits
- Bit-slice auction circuit
- How to obtain full privacy in auctions
- Verifiable shuffles: a formal model and a Paillier-based three-round construction with provable security
- Electronic jury voting protocols
- Efficient privacy-preserving outsourced \(k\)-means clustering on distributed data
- Protocol completion incentive problems in cryptographic Vickrey auctions
This page was built for publication: Mix and match: Secure function evaluation via ciphertexts. (Extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2707412)
