The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
MiMC: Efficient Encryption and Cryptographic Hashing with Minimal Multiplicative Complexity
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Handbook of Applied Cryptography
Menezes, A. J., van Oorschot, P. C., & Vanstone, S. A. (2018) · CRC Press eBooks · doi:10.1201/9781439821916 · Cited by 2,896
Zerocash: Decentralized Anonymous Payments from Bitcoin
Ben Sasson, E., Chiesa, A., Garman, C., Green, M., Miers, I., Tromer, E., & Virza, M. (2014) · 2014 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2014.36 · Cited by 1,925
Generating hard instances of lattice problems (extended abstract)
Ajtai, M. (1996) · Proceedings of the twenty-eighth annual ACM symposium on Theory of computing - STOC '96 · doi:10.1145/237814.237838 · Cited by 1,405
Pohlig, S., & Hellman, M. (1978) · IEEE Transactions on Information Theory · doi:10.1109/tit.1978.1055817 · Cited by 1,199
Differentially uniform mappings for cryptography
Nyberg, K. (2007) · Lecture Notes in Computer Science · doi:10.1007/3-540-48285-7_6 · Cited by 899
SHA-3 standard: permutation-based hash and extendable-output functions
National Institute of Standards and Technology (US) (2015) · doi:10.6028/nist.fips.202 · Cited by 783
The SIMON and SPECK Families of Lightweight Block Ciphers.Preprint
Beaulieu, R., Shors, D., Smith, J., Treatman-Clark, S., Weeks, B., & Wingers, L. (2013) · IACR Cryptology ePrint Archive · Cited by 622
SNARKs for C: Verifying Program Executions Succinctly and in Zero Knowledge
Ben-Sasson, E., Chiesa, A., Genkin, D., Tromer, E., & Virza, M. (2013) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-40084-1_6 · Cited by 598
On the Indifferentiability of the Sponge Construction
Bertoni, G., Daemen, J., Peeters, M., & Van Assche, G. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-78967-3_11 · Cited by 425
Number-theoretic constructions of efficient pseudo-random functions
Naor, M., & Reingold, O. (2002) · Proceedings 38th Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1997.646134 · Cited by 353
The interpolation attack on block ciphers
Jakobsen, T., & Knudsen, L. R. (1997) · Lecture Notes in Computer Science · doi:10.1007/bfb0052332 · Cited by 298
Albrecht, M. R., Rechberger, C., Schneider, T., Tiessen, T., & Zohner, M. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46800-5_17 · Cited by 290
Self-citationMontgomery Multiplication in GF(2k)
Koc, C. K., & Acar, T. (1998) · Designs, Codes and Cryptography · doi:10.1023/a:1008208521515 · Cited by 266
SWIFFT: A Modest Proposal for FFT Hashing
Lyubashevsky, V., Micciancio, D., Peikert, C., & Rosen, A. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-71039-4_4 · Cited by 265
New Stream Cipher Designs: The eSTREAM Finalists
(2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3 · Cited by 263
De Cannière, C., & Preneel, B. (2008) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-68351-3_18 · Cited by 243
Grain-128a: A new version of Grain-128 with optional authentication
Ågren, M., Hell, M., Johansson, T., & Meier, W. (2011) · International Journal of Wireless and Mobile Computing · doi:10.1504/ijwmc.2011.044106 · Cited by 228
Parno (2016) · doi:10.1145/2856449 · Cited by 212
Provable security against a differential attack
Nyberg, K., & Knudsen, L. R. (1995) · Journal of Cryptology · doi:10.1007/bf00204800 · Cited by 197
Geppetto: Versatile Verifiable Computation
Costello, C., Fournet, C., Howell, J., Kohlweiss, M., Kreuter, B., Naehrig, M., Parno, B., & Zahur, S. (2015) · 2015 IEEE Symposium on Security and Privacy · doi:10.1109/sp.2015.23 · Cited by 194
LS-Designs: Bitslice Encryption for Efficient Masked Software Implementations
Grosso, V., Leurent, G., Standaert, F.-X., & Varıcı, K. (2015) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-46706-0_2 · Cited by 166
Towards Stream Ciphers for Efficient FHE with Low-Noise Ciphertexts
Méaux, P., Journault, A., Standaert, F.-X., & Carlet, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-662-49890-3_13 · Cited by 164
Knudsen, L. R., & Robshaw, M. J. B. (2011) · Information Security and Cryptography · doi:10.1007/978-3-642-17342-4 · Cited by 162
Logic Minimization Techniques with Applications to Cryptology
Boyar, J., Matthews, P., & Peralta, R. (2013) · Journal of Cryptology · doi:10.1007/s00145-012-9124-7 · Cited by 160
Efficient algorithms for elliptic curve cryptosystems
Guajardo, J., & Paar, C. (1997) · Lecture notes in computer science · doi:10.1007/bfb0052247 · Cited by 140
Stream Ciphers: A Practical Solution for Efficient Homomorphic-Ciphertext Compression
Canteaut, A., Carpov, S., Fontaine, C., Lepoint, T., Naya‐Plasencia, M., Paillier, P., & Sirdey, R. (2016) · Lecture notes in computer science · doi:10.1007/978-3-662-52993-5_16 · Cited by 139
A Small Depth-16 Circuit for the AES S-Box
Boyar, J., & Peralta, R. (2012) · IFIP International Federation for Information Processing/IFIP · doi:10.1007/978-3-642-30436-1_24 · Cited by 126
Higher-Order Masking Schemes for S-Boxes
Carlet, C., Goubin, L., Prouff, E., Quisquater, M., & Rivain, M. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-34047-5_21 · Cited by 120
On the complexity of the F 5 Gröbner basis algorithm
Bardet, M., Faugère, J., & Salvy, B. (2014) · Journal of Symbolic Computation · doi:10.1016/j.jsc.2014.09.025 · Cited by 113
MPC-Friendly Symmetric Key Primitives
Grassi, L., Rechberger, C., Rotaru, D., Schöll, P., & Smart, N. P. (2016) · ACM SIGSAC Conference on Computer and Communications Security (CCS) · doi:10.1145/2976749.2978332 · Cited by 85
Self-citationPublic-Key Cryptosystems with Very Small Key Lengths
Harper, G., Menezes, A., & Vanstone, S. A. (2007) · Springer eBooks · doi:10.1007/3-540-47555-9_14 · Cited by 71
On the Distribution of Linear Biases: Three Instructive Examples
Abdelraheem, M. A., Ågren, M., Beelen, P., & Leander, G. (2012) · Lecture notes in computer science · doi:10.1007/978-3-642-32009-5_4 · Cited by 34
SPRING: Fast Pseudorandom Functions from Rounded Ring Products
Banerjee, A., Brenner, H., Leurent, G., Peikert, C., & Rosen, A. (2015) · Lecture notes in computer science · doi:10.1007/978-3-662-46706-0_3 · Cited by 19
Ciphers for MPC and FHE.Preprint
Albrecht, M. R., Rechberger, C., Schneider, T. H., et al. (2016) · IACR Cryptology ePrint Archive · Cited by 8
Self-citation
Cited by
Boneh, D., Bonneau, J., Bünz, B., & Fisch, B. (2018) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-96884-1_25 · Cited by 413
Metadata
- Authors
- Albrecht, M., Grassi, L., Rechberger, C., Roy, A., & Tiessen, T.
- Venue
- Lecture Notes in Computer Science
- Publisher
- Springer Berlin Heidelberg
- Published
- 2016
- Pages
- 191-219
- ISSN
- 0302-9743 (ISSN-L)
- 1611-3349
- OpenAlex
- W2552640487
- Cited by
- 258
- References
- 34
- FWCI
- 3.27
- Type
- conference paper
- Language
- en
- Open access
- green
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.