Towards building efficient SCALES protocols

DOI10.1007/978-981-95-5116-3_2MaRDI QIDQ7232550zbMATH OpenFDO

Authors Anasuya Acharya, Carmit Hazay, Vladimir Kolesnikov, Manoj Prabhakaran

Publication date 23 April 2026

Full work available at URL https://doi.org/10.1007/978-981-95-5116-3_2

zbMATH Keywords

small clients and larger ephemeral servers

Mathematics Subject Classification ID

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

Cites work

• \(i\)-hop homomorphic encryption and rerandomizable Yao circuits
• A Framework for Efficient and Composable Oblivious Transfer
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Circular-Secure Encryption from Decision Diffie-Hellman
• Efficient MPC with a Mixed Adversary
• Evaluating Branching Programs on Encrypted Data
• Fluid MPC: secure multiparty computation with dynamic participants
• Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation
• Graph-Based Algorithms for Boolean Function Manipulation
• How to Garble Arithmetic Circuits
• scientific article; zbMATH DE number 1722674 (Why is no real title available?)
• Information, security and cryptology -- ICISC 2009. 12th international conference, Seoul, Korea, December 2--4, 2009. Revised selected papers
• Le Mans: dynamic and fluid MPC for dishonest majority
• Linearly homomorphic encryption from \(\mathsf {DDH}\)
• Malicious security for SCALES. Outsourced computation with ephemeral servers
• Random-index PIR and applications
• Rerandomizable garbling, revisited
• SCALES. MPC with small clients and larger ephemeral servers
• Secure multiparty computation from threshold encryption based on class groups
• YOSO: You only speak once. Secure MPC with stateless ephemeral roles

This page was built for publication: Towards building efficient SCALES protocols

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7232550)