Linear secret-shared shuffle with malicious security
From MaRDI portal
Cites work
- A Permutation Network
- A Survey of Single-Database Private Information Retrieval: Techniques and Applications
- Actively secure OT extension with optimal overhead
- Alibi: a flaw in cuckoo-hashing based hierarchical ORAM schemes and a solution
- Boosting verifiable computation on encrypted data
- Distributed Oblivious RAM for Secure Two-Party Computation
- Flexible and efficient verifiable computation on encrypted data
- Foundations of Cryptography
- Fully homomorphic message authenticators
- HELIOPOLIS: verifiable computation over homomorphically encrypted data from interactive oracle proofs is practical
- scientific article; zbMATH DE number 1178976 (Why is no real title available?)
- scientific article; zbMATH DE number 819814 (Why is no real title available?)
- scientific article; zbMATH DE number 7706039 (Why is no real title available?)
- Lattice-based SNARGs and their application to more efficient obfuscation
- Leveraging linear decryption: rate-1 fully-homomorphic encryption and time-lock puzzles
- Multiparty Computation from Somewhat Homomorphic Encryption
- MuxProofs: succinct arguments for machine computation from vector lookups
- Overdrive2k: efficient secure MPC over \(\mathbb{Z}_{2^k}\) from somewhat homomorphic encryption
- Path ORAM
- Practical covertly secure MPC for dishonest majority -- or: breaking the SPDZ limits
- Practical homomorphic MACs for arithmetic circuits
- Practically efficient multi-party sorting protocols from comparison sort algorithms
- Privacy-preserving Dijkstra
- Private database access with HE-over-ORAM architecture
- Quasi-optimal SNARGs via linear multi-prover interactive proofs
- Rinocchio: SNARKs for ring arithmetic
- Secret-shared shuffle
- Semi-homomorphic encryption and multiparty computation
- Software protection and simulation on oblivious RAMs
- Statistical tables for biological, agricultural and medical research.
- Succinct non-interactive arguments via linear interactive proofs
- Verifiable computation for approximate homomorphic encryption schemes
- Yes, there is an oblivious RAM lower bound!
This page was built for publication: Linear secret-shared shuffle with malicious security
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7443575)