Evaluating Ascon in Secure Multi-Party Computation using Reverse Multiplication-Friendly Embeddings
Open Access
- 13 October 2025
- conference paper
- Published by Association for Computing Machinery (ACM)
- p. 60-74
Abstract
No abstract availableFunding Information
- Vlaamse Overheid (VR20192203,S003321N)
- European Union (101120726)
This publication has 34 references indexed in Scilit:
- Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC2024
- Publicly Verifiable Zero-Knowledge and Post-Quantum Signatures from VOLE-in-the-Head2023
- Unconditional Communication-Efficient MPC via Hall’s Marriage Theorem2021
- Order-C Secure Multiparty Computation for Highly Repetitive Circuits2021
- Amortized Complexity of Information-Theoretically Secure MPC Revisited2018
- Faster Secure Multi-party Computation of AES and DES Using Lookup Tables2017
- Fast Oblivious AES A Dedicated Application of the MiniMac ProtocolLecture Notes in Computer Science, 2016
- Perfectly-Secure MPC with Linear Communication Complexity2008
- Computing on Encrypted Data2008
- Scalable and Unconditionally Secure Multiparty Computation2007