MPC-friendly symmetric cryptography from alternating moduli: candidates, protocols, and applications

DOI10.1007/978-3-030-84259-8_18zbMath1489.94095OpenAlexW3164508328MaRDI QIDQ2139646

Yanyan Li

Publication date: 18 May 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-84259-8_18

zbMATH Keywords

signature schemessecure multiparty computationsymmetric cryptographic primitives

Mathematics Subject Classification ID

Cryptography (94A60) Authentication, digital signatures and secret sharing (94A62)

Related Items

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 ⋮ One-message secure reductions: on the cost of converting correlations ⋮ Learning with physical rounding for linear and quadratic leakage functions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• BBQ: using AES in Picnic signatures
• One way functions and pseudorandom generators
• Exploring crypto dark matter: new simple PRF candidates and their applications
• The TinyTable protocol for 2-party secure computation, or: Gate-scrambling revisited
• On the concrete security of Goldreich's pseudorandom generator
• Sigma protocols for MQ, PKP and SIS, and fishy signature schemes
• Function secret sharing for mixed-mode and fixed-point secure computation
• Banquet: short and fast signatures from AES
• Adventures in crypto dark matter: attacks and fixes for weak pseudorandom functions
• Efficient pseudorandom correlation generators from ring-LPN
• Feistel structures for MPC, and more
• Secure computation with preprocessing via function secret sharing
• Zero-knowledge proofs on secret-shared data via fully linear PCPs
• Efficient pseudorandom correlation generators: silent OT extension and more
• Improved classical and quantum algorithms for subset-sum
• Private Large-Scale Databases with Distributed Searchable Symmetric Encryption
• Round-Optimal Password-Protected Secret Sharing and T-PAKE in the Password-Only Model
• Ciphers for MPC and FHE
• Function Secret Sharing
• On the Cryptographic Applications of Random Functions (Extended Abstract)
• Candidate weak pseudorandom functions in AC ⁰ ○ MOD ₂
• Improved Generic Algorithms for Hard Knapsacks
• Candidate One-Way Functions Based on Expander Graphs
• How to Generate Cryptographically Strong Sequences of Pseudorandom Bits
• New Generic Algorithms for Hard Knapsacks
• Secure Multiparty AES
• Efficient Oblivious Pseudorandom Function with Applications to Adaptive OT and Secure Computation of Set Intersection
• Secure Two-Party Computation Is Practical
• Revisiting the Concrete Security of Goldreich’s Pseudorandom Generator
• LegRoast: Efficient Post-quantum Signatures from the Legendre PRF
• Algorithms and lower bounds for de morgan formulas of low-communication leaf gates
• Strong average-case lower bounds from non-trivial derandomization
• Advances in Cryptology - CRYPTO 2003
• Theory of Cryptography
• Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs