Filters








16 Hits in 6.4 sec

MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity [chapter]

Martin Albrecht, Lorenzo Grassi, Christian Rechberger, Arnab Roy, Tyge Tiessen
2016 Lecture Notes in Computer Science  
We explore cryptographic primitives with low multiplicative complexity.  ...  To that end, our proposal for both block ciphers and cryptographic hash functions is to reconsider and simplify the round function of the Knudsen-Nyberg cipher from 1995.  ...  Acknowledgements We thank Alessandro Chiesa, Eran Tromer and Madars Virza for helpful discussions on SNARKs.  ... 
doi:10.1007/978-3-662-53887-6_7 fatcat:izrbax5ncva43jc45gfhioo7ai

HERMES: Scalable, Secure, and Privacy-Enhancing Vehicular Sharing-Access System

Iraklis Symeonidis, Dragos Rotaru, Mustafa A. Mustafa, Bart Mennink, Bart Preneel, Panos Papadimitratos
2021 IEEE Internet of Things Journal  
To cater to system and user needs for secure and private computations, HERMES utilizes and combines several cryptographic primitives with secure multiparty computation efficiently.  ...  We build our evaluations with two different multiparty computation protocols: HtMAC-MiMC and CBC-MAC-AES.  ...  We provide complete representation of HERMES including all cryptographic operations and messages exchanged for Step 1 -Step 4.  ... 
doi:10.1109/jiot.2021.3094930 fatcat:snxktz26qfc6zj5qydwukmergm

HERMES: Scalable, Secure, and Privacy-Enhancing Vehicle Access System [article]

Iraklis Symeonidis, Dragos Rotaru, Mustafa A. Mustafa, Bart Mennink, Bart Preneel, Panos Papadimitratos
2021 arXiv   pre-print
To cater to system and user needs for secure and private computations, HERMES utilizes and combines several cryptographic primitives with secure multiparty computation efficiently.  ...  We build our evaluations with two different multiparty computation protocols: HtMAC-MiMC and CBC-MAC-AES.  ...  We benchmarked the cryptographic operations and secure multiparty evaluations testing over arithmetic circuits with HtMAC-MiMC demonstrating its efficiency and scalability.  ... 
arXiv:2101.01950v2 fatcat:fxx7lc6rbvcp7epxr6gl5l7vka

MPC-Friendly Symmetric Key Primitives

Lorenzo Grassi, Christian Rechberger, Dragos Rotaru, Peter Scholl, Nigel P. Smart
2016 Proceedings of the 2016 ACM SIGSAC Conference on Computer and Communications Security - CCS'16  
We consider three different PRFs: the Naor-Reingold PRF, a PRF based on the Legendre symbol, and a specialized block cipher design called MiMC.  ...  Depending on the application, different PRFs may offer different optimizations and advantages over the classic AES benchmark.  ...  N66001-15-C-4070, and by the Austrian Science Fund via project P26494-N15.  ... 
doi:10.1145/2976749.2978332 dblp:conf/ccs/0001RRSS16 fatcat:xremlyoyjjghdjzkcozdwe7ouu

An Anonymous On-Street Parking Authentication Scheme via Zero-Knowledge Set Membership Proof [article]

Jerry Chien Lin Ho, Chi-Yi Lin
2021 arXiv   pre-print
Based upon our previous on-street parking system utilizing Bluetooth Low Energy (BLE) beacons, we applied a cryptographic primitive called zero-knowledge proof to our authentication system.  ...  The amount of information generated grows as more and more sensor and IoT devices are deployed in smart cities.  ...  Also, by applying "circuit/snark friendly cryptographic primitives" such as Poseidon hash, MiMC sponge hash, Pedersen commitment, or Kate commitment, the efficiency can be greatly increased.  ... 
arXiv:2108.03629v1 fatcat:2pkj3yjxkjbhtfvnitrgvsrgiu

Design of Symmetric-Key Primitives for Advanced Cryptographic Protocols

Abdelrahaman Aly, Tomer Ashur, Eli Ben-Sasson, Siemen Dhooghe, Alan Szepieniec
2020 IACR Transactions on Symmetric Cryptology  
as multi-party computation and zero knowledge proofs require optimization with respect to a different metric: arithmetic complexity.  ...  In this paper we study the design of secure cryptographic algorithms optimized to minimize this metric.  ...  Additionally, we want to thank the anonymous reviewers and Brice Minaud for sheparding the work.  ... 
doi:10.13154/tosc.v2020.i3.1-45 dblp:journals/tosc/AlyABDS20 fatcat:r6cdvzcaabbh3iow6oaopw5dym

Post-Quantum Zero-Knowledge Proofs for Accumulators with Applications to Ring Signatures from Symmetric-Key Primitives [chapter]

David Derler, Sebastian Ramacher, Daniel Slamanig
2018 Lecture Notes in Computer Science  
In this paper we address the construction of privacy-friendly cryptographic primitives for the post-quantum era and in particular accumulators with zero-knowledge membership proofs and ring signatures.  ...  Finally, we want to stress that our work also indirectly impacts other fields: for the first time it raises the requirement for collision resistant hash functions with particularly low AND count.  ...  We thank Christian Rechberger for discussions on the choice of symmetric-key primitives, especially regarding the instantiation of hash functions using LowMC, as well as for providing us with updated LowMC  ... 
doi:10.1007/978-3-319-79063-3_20 fatcat:hyxy7lzs2nh37kjtclm2s354ce

Post-Quantum Zero-Knowledge and Signatures from Symmetric-Key Primitives

Melissa Chase, David Derler, Steven Goldfeder, Claudio Orlandi, Sebastian Ramacher, Christian Rechberger, Daniel Slamanig, Greg Zaverucha
2017 Proceedings of the 2017 ACM SIGSAC Conference on Computer and Communications Security - CCS '17  
We implement and benchmark both approaches and explore the possible choice of f , taking advantage of the recent trend to strive for practical symmetric ciphers with a particularly low number of multiplications  ...  Rechberger, and D. Post-Quantum Signatures. Perhaps the oldest signature scheme with post-quantum security are one-time Lamport [61] signatures, built using hash functions.  ...  Note that MiMC is the only design in this category which aims at minimizing multiplications in a field larger than F 2 .  ... 
doi:10.1145/3133956.3133997 dblp:conf/ccs/ChaseDGORRSZ17 fatcat:zz67tvgotzfs7kjhwtj7kmi7ry

Rasta: A Cipher with Low ANDdepth and Few ANDs per Bit [chapter]

Christoph Dobraunig, Maria Eichlseder, Lorenzo Grassi, Virginie Lallemand, Gregor Leander, Eik List, Florian Mendel, Christian Rechberger
2018 Lecture Notes in Computer Science  
Recent developments in multi party computation (MPC) and fully homomorphic encryption (FHE) promoted the design and analysis of symmetric cryptographic schemes that minimize multiplications in one way  ...  In this paper, we propose with Rasta a design strategy for symmetric encryption that has ANDdepth d and at the same time only needs d ANDs per encrypted bit.  ...  This research was supported by H2020 project Prismacloud, grant agreement n • 644962 and by the Austrian Science Fund (project P26494-N15).  ... 
doi:10.1007/978-3-319-96884-1_22 fatcat:6hp6gfkjp5c55pexcez574ul5e

Classification of Balanced Quadratic Functions

Lauren De Meyer, Begül Bilgin
2019 IACR Transactions on Symmetric Cryptology  
We demonstrate its use by decomposing existing higher degree S-boxes and constructing new S-boxes with good cryptographic and implementation properties.  ...  These functions can be valuable for new cryptographic algorithm designs with efficient multi-party computation or side-channel analysis resistance as goal.  ...  Acknowledgments The authors thank Dusan Bozilov for the insights into his algorithm and Prof. Vincent Rijmen for fruitful discussion and helpful comments.  ... 
doi:10.13154/tosc.v2019.i2.169-192 dblp:journals/tosc/MeyerB19 fatcat:db2jrsneerapxmbnjumwkla62a

Classification of Balanced Quadratic Functions

Lauren De Meyer, Begül Bilgin
2019 IACR Transactions on Symmetric Cryptology  
We demonstrate its use by decomposing existing higher degree S-boxes and constructing new S-boxes with good cryptographic and implementation properties.  ...  These functions can be valuable for new cryptographic algorithm designs with efficient multi-party computation or side-channel analysis resistance as goal.  ...  Acknowledgments The authors thank Dusan Bozilov for the insights into his algorithm and Prof. Vincent Rijmen for fruitful discussion and helpful comments.  ... 
doi:10.46586/tosc.v2019.i2.169-192 fatcat:miobcecw3jcnvpz4pgnpcunkhi

MOE: Multiplication Operated Encryption with Trojan Resilience

Olivier Bronchain, Sebastian Faust, Virginie Lallemand, Gregor Leander, Léo Perrin, François-Xavier Standaert
2021 IACR Transactions on Symmetric Cryptology  
To reach this goal, we exploit a simple round structure mixing a modular multiplication and a multiplication with a binary matrix.  ...  Besides being motivated as a new block cipher design for Trojan resilience, our research also exposes the cryptographic properties of the modular multiplication, which is of independent interest.  ...  This work was initiated while Virginie Lallemand was with the Horst Görtz Institute for IT Security at the Ruhr-Universität Bochum and was funded by the DFG through LE 3372/4-1.  ... 
doi:10.46586/tosc.v2021.i1.78-129 fatcat:c7uahfko6bhhphx7co6leauqde

Fairness, Integrity, and Privacy in a Scalable Blockchain-based Federated Learning System [article]

Timon Rückel and Johannes Sedlmeir and Peter Hofmann
2021 arXiv   pre-print
Our implementation of a proof-of-concept with multiple linear regression illustrates that these state-of-the-art technologies can be combined to a FL system that aligns economic incentives, trust, and  ...  confidentiality requirements in a scalable and transparent system.  ...  Acknowledgment: We want to thank Orestis Papageorgiou, who pointed us to the work of Newman [67] , and Jordi Baylina and the iden3-Team for their great work on circom and snarkjs and their helpful responses  ... 
arXiv:2111.06290v1 fatcat:75petiw72req3gy2bujgqy7wg4

Interpolation Cryptanalysis of Unbalanced Feistel Networks with Low Degree Round Functions

Ferdinand Sauer
2019
Summarizing the result, for hash functions generating exactly one field element collisions can be found more efficiently than the birthday bound if the UFN has fewer rounds than log d p + t − 1.  ...  The proposed method is applicable for finding collisions, preimages, and second preimages.  ...  Hash Functions Cryptographic hash functions serve a multitude of purposes as cryptographic primitives. For example, they can be used for message authentication codes and in digital signatures.  ... 
doi:10.5445/ir/1000124048 fatcat:zpffuwqdlrasxhpdvolf437hqy

Scalable and privacy-preserving off-chain computations

Jacob Eberhardt, Technische Universität Berlin, Stefan Tai
2021
Their instantiation is complex and error-prone; suitable programming abstractions and software tools are missing.  ...  We identify zero-knowledge succinct non-interactive arguments of knowledge (zk-SNARKs), a class of cryptographic protocols, as the most suitable approach.  ...  Acknowledgements This thesis could not have been completed without the support of many brilliant minds who inspired, influenced, and supported me over the last years.  ... 
doi:10.14279/depositonce-11883 fatcat:givpsqfi2rgkbjz2ohkpdbr3r4
« Previous Showing results 1 — 15 out of 16 results