Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC

Abidin, Aysajan; Pohle, Erik; Preneel, Bart

doi:10.1007/978-3-031-50594-2_5

Lecture Notes in Computer Science

2024

DOI: 10.1007/978-3-031-50594-2_5

|View full text |Cite

Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC

Aysajan Abidin,

Erik Pohle,

Bart Preneel

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2024

Publication Types

Select...

Article1

Relationship

Self Cite1

Independent0

Authors

Journals

Cited by 1 publication

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

Fast Evaluation of S-Boxes With Garbled Circuits

Pohle,

Abidin,

Preneel

2024

IEEE Trans.Inform.Forensic Secur.

Self Cite

View full text Add to dashboard Cite

Garbling schemes, a formalization of Yao's garbled circuit protocol, are useful cryptographic primitives both in privacy-preserving protocols and for secure two-party computation. In projective garbling schemes, n values are assigned to each wire in the circuit. Current stateof-the-art schemes project two values. More concretely, we present a projective garbling scheme that assigns 2 n values to wires in a circuit comprising XOR and unary projection gates. A generalization of FreeXOR allows the XOR of wires with 2 n values to be very efficient. We then analyze the performance of our scheme by evaluating substitution-permutation ciphers. Using our proposal, we measure high-speed evaluation of the ciphers with a moderate increased cost in garbling and bandwidth. Theoretical analysis suggests that for evaluating the nine examined ciphers, one can expect a 4-to 70-fold increase in evaluation with at most a 4-fold increase in garbling cost and, at most, an 8-fold increase in communication cost when compared to stateof-the-art garbling schemes. In an offline/online setting, such as secure function evaluation as a service, the circuit garbling and communication to the evaluator can proceed before the input phase. Thus our scheme offers a fast online phase. Furthermore, we present efficient computation formulas for the S-boxes of TWINE and Midori64 in Boolean circuits. To our knowledge, our formulas give the smallest number of AND gates for the S-boxes of these two ciphers.

show abstract

Fast Evaluation of S-Boxes With Garbled Circuits

Pohle,

Abidin,

Preneel

2024

IEEE Trans.Inform.Forensic Secur.

Self Cite

View full text Add to dashboard Cite

show abstract

scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.

Contact Info

customersupport@researchsolutions.com

10624 S. Eastern Ave., Ste. A-614

Henderson, NV 89052, USA

This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.

Blog Terms and Conditions API Terms Privacy Policy Contact Cookie Preferences Do Not Sell or Share My Personal Information

Made with 💙 for researchers

Part of the Research Solutions Family.

Arithmetic Circuit Implementations of S-boxes for SKINNY and PHOTON in MPC

Cited by 1 publication

References 30 publications

Fast Evaluation of S-Boxes With Garbled Circuits

Fast Evaluation of S-Boxes With Garbled Circuits

Contact Info

Product

Resources

About