MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
From MaRDI portal
Publication:2139646
Recommendations
- Feistel structures for MPC, and more
- Ciphers for MPC and FHE
- Exploring crypto dark matter: new simple PRF candidates and their applications
- \(\mathrm{SPD}\mathbb {Z}_{2^k}\): efficient MPC \(\mod 2^k\) for dishonest majority
- MiMC: efficient encryption and cryptographic hashing with minimal multiplicative complexity
Cites work
- scientific article; zbMATH DE number 5485433 (Why is no real title available?)
- scientific article; zbMATH DE number 4070803 (Why is no real title available?)
- scientific article; zbMATH DE number 176564 (Why is no real title available?)
- scientific article; zbMATH DE number 7561745 (Why is no real title available?)
- scientific article; zbMATH DE number 4187706 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
- Algorithms and lower bounds for De Morgan formulas of low-communication leaf gates
- BBQ: using AES in Picnic signatures
- Banquet: short and fast signatures from AES
- Candidate one-way functions based on expander graphs
- Candidate weak pseudorandom functions in \(\mathrm{AC}^0\circ\mathrm{MOD}_2\)
- Ciphers for MPC and FHE
- Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
- Efficient pseudorandom correlation generators from ring-LPN
- Efficient pseudorandom correlation generators: silent OT extension and more
- Exploring crypto dark matter: new simple PRF candidates and their applications
- Feistel structures for MPC, and more
- Function secret sharing
- Function secret sharing for mixed-mode and fixed-point secure computation
- How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
- Improved Generic Algorithms for Hard Knapsacks
- Improved classical and quantum algorithms for subset-sum
- LegRoast: efficient post-quantum signatures from the Legendre PRF
- New generic algorithms for hard knapsacks
- On the Cryptographic Applications of Random Functions (Extended Abstract)
- On the concrete security of Goldreich's pseudorandom generator
- One way functions and pseudorandom generators
- Private large-scale databases with distributed searchable symmetric encryption
- Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
- Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
- Secure Multiparty AES
- Secure computation with preprocessing via function secret sharing
- Secure two-party computation is practical
- Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
- Strong average-case lower bounds from non-trivial derandomization
- Substitution-permutation networks, pseudorandom functions, and natural proofs
- The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
- Theory of Cryptography
- Zero-knowledge proofs on secret-shared data via fully linear PCPs
Cited in
(13)- Practical \(\mathsf{MP} \text{- }\mathsf{LWE}\)-based encryption balancing security-risk versus efficiency
- Feistel structures for MPC, and more
- One-message secure reductions: on the cost of converting correlations
- Learning with physical rounding for linear and quadratic leakage functions
- Composable oblivious pseudo-random functions via garbled circuits
- The patching landscape of Elisabeth-4 and the mixed filter permutator paradigm
- Adventures in crypto dark matter: attacks, fixes and analysis for weak pseudorandom functions
- From Farfalle to \textsc{Megafono} via Ciminion: the PRF \textsc{Hydra} for MPC applications
- Crypto dark matter on the torus. Oblivious PRFs from shallow PRFs and TFHE
- Fast public-key silent OT and more from constrained Naor-Reingold
- Improved alternating-moduli PRFs and post-quantum signatures
- Instantiating the hash-then-evaluate paradigm: strengthening PRFs, PCFs, and OPRFs
- Efficient zero-knowledge arguments and digital signatures \textit{via} sharing conversion \textit{in the head}
This page was built for publication: MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2139646)
