Advances in Cryptology - EUROCRYPT 2007 [electronic resources]: 26th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Barcelona, Spain, May 20-24, 2007.... by EUROCRYPT (2007 : Barcelona, Spain), Naor, Moni, SpringerLink (Online service)

Get full text

Advances in cryptology-EUROCRYT 2002 : international conference on the theory and applications of cryptographic techniques, Amsterdam, The Netherlands, April 28-May 2, 2002 : proce... by EUROCRYPT (2002 : Amsterdam, Netherlands), Knudsen, Lars

Statistical zapr arguments from bilinear maps

“…Our construction relies on a combination of several tools, including the Groth-Ostrovsky-Sahai NIZK and NIWI [EUROCRYPT ’06, CRYPTO ’06, JACM ’12], “sometimes-binding statistically hiding commitments” [Kalai-Khurana-Sahai, EUROCRYPT ’18] and the “MPC-in-the-head” technique [Ishai-Kushilevitz-Ostrovsky-Sahai, STOC ’07].…”
Get full text

Statistical zapr arguments from bilinear maps by Lombardi, Alex, Vaikuntanathan, Vinod, Wichs, Daniel

“…Our construction relies on a combination of several tools, including the Groth-Ostrovsky-Sahai NIZK and NIWI [EUROCRYPT ’06, CRYPTO ’06, JACM ’12], “sometimes-binding statistically hiding commitments” [Kalai-Khurana-Sahai, EUROCRYPT ’18] and the “MPC-in-the-head” technique [Ishai-Kushilevitz-Ostrovsky-Sahai, STOC ’07].…”
Get full text

TNT : how to tweak a block cipher by Bao, Zhenzhen, Guo, Chun, Guo, Jian, Song, Ling

Get full text

Diving deep into the preimage security of AES-like hashing by Chen, Shiyao, Guo, Jian, List, Eik, Shi, Danping, Zhang, Tianyu

“…Since the seminal works by Sasaki and Aoki, Meet-in-the-Middle (MITM) attacks are recognized as an effective technique for preimage and collision attacks on hash functions. At Eurocrypt 2021, Bao et al. automated MITM attacks on AES-like hashing and improved upon the best manual result. …”
Get full text

A CP-ABE Scheme Based on Lattice LWE and Its Security Analysis by Yunfei Yao, Huiyan Chen, Linzhi Shen, Ke Wang, Qingnan Wang

“…Technically, we use the new lattice two-stage sampling technique of Lai, Liu, and Wang (EUROCRYPT 2021) in the key generation phase instead of the extended trapdoor sampling technique. …”
Get full text

Automatic search of Meet-in-the-Middle preimage attacks on AES-like hashing by Bao, Zhenzhen, Dong, Xiaoyang, Guo, Jian, Li, Zheng, Shi, Danping, Sun, Siwei, Wang, Xiaoyun

Get full text

Private Constrained PRFs (and More) from LWE by Brakerski, Zvika, Tsabary, Rotem, Vaikuntanathan, Vinod, Wee, Hoeteck

“…Boneh, Kim and Montgomery (EUROCRYPT 2017) recently presented a construction of private constrained PRF for point function constraints, and Canetti and Chen (EUROCRYPT 2017) presented a completely different construction for more general NC1 constraints. …”
Get full text

Fully homomorphic encryption over the integers for non-binary plaintexts without the sparse subset sum problem by Aung, Khin Mi Mi, Lee, Hyung Tae, Tan, Benjamin Hong Meng, Wang, Huaxiong

“…To that end, we provide a natural extension of the somewhat homomorphic encryption (SHE) scheme over the integers proposed by Cheon and Stehlé (Eurocrypt 2015) to support non-binary plaintexts. Then, a novel bootstrapping algorithm is proposed for this extended SHE scheme by introducing generalizations of several functions in binary arithmetic. …”
Get full text

Reusable Fuzzy Extractors for Low-Entropy Distributions by Canetti, Ran, Fuller, Benjamin, Paneth, Omer, Reyzin, Leonid, Smith, Adam

“…Fuzzy extractors (Dodis et al., in Advances in cryptology—EUROCRYPT 2014, Springer, Berlin, 2014, pp 93–110) convert repeated noisy readings of a secret into the same uniformly distributed key. …”
Get full text

Algebraic manipulation detection codes by Cramer, Ronald, Fehr, Serge, Padró, Carles

“…Algebraic manipulation detection codes are a cryptographic primitive that was introduced by Cramer et al. (Eurocrypt 2008). It encompasses several methods that were previously used in cheater detection in secret sharing. …”
Get full text
Get full text

Towards breaking the exponential barrier for general secret sharing by Liu, Tianren, Vaikuntanathan, Vinod, Wee, Hoeteck

Get full text

Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs by Lombardi, Alex, Vaikuntanathan, Vinod

“…As a corollary (following Choudhuri et al., ePrint 2019 and Ephraim et al., EUROCRYPT 2020), we construct hard-on-average problems in the complexity class (Formula Presented) under the (Formula Presented)-hardness of the repeated squaring problem and the (Formula Presented)-hardness of the learning with errors problem. …”
Get full text

Improved security analysis of PMAC by Nandi Mridul, Mandal Avradip

“…In the original paper of PMAC by Black and Rogaway in Eurocrypt-2002, the bound was shown to be (σ + 1)2/2n–1. …”
Get full text

A TWOOA construction for multi-receiver multi-message authentication codes by Fuji-Hara Ryoh, Li Xiyang, Miao Ying, Wu Dianhua

“…In this paper, we generalize the notion of a TWOOA, and then use this generalized TWOOA to construct a (k, n; w) multi-receiver multi-message authentication code, which exceeds that of Safavi-Naini and Wang [Proc. of Eurocrypt'98, LNCS 1403, Springer (1998), pp. 527–541] at least in the numbers of receivers and authenticated messages. …”
Get full text

Lattice-Based Logarithmic-Size Non-Interactive Deniable Ring Signatures by Huiwen Jia, Chunming Tang, Yanhua Zhang

“…From a high level, we adapt Libert et al.’s zero-knowledge argument system (Eurocrypt 2016) to allow the prover to convince the verifier that its witness satisfies an additional condition. …”
Get full text

Lattices in constructions of dense sphere packings and certain cryptographic schemes by Cheng, Shantian

“…We present an RIBE scheme from lattices by combining two Agrawal et al.’s IBE schemes (Eurocrypt 2010) with the subset difference method. …”
Get full text

Improved related‐tweakey rectangle attacks on round‐reduced Deoxys‐BC by Jiamei Liu, Lin Tan, Hong Xu

“…Under the new related‐key rectangle attack framework proposed by Dong et al. in EUROCRYPT 2022, we present three kinds of precomputed tables to further reduce the time complexity in the key‐recovery phase. …”
Get full text

An Approach to the Construction of a Recursive Argument of Polynomial Evaluation in the Discrete Log Setting by Sungwook Kim

“…Bünz et al. recently presented a novel polynomial commitment scheme with no trusted setup in Eurocrypt’20. To provide a transparent setup, their scheme is built over an ideal class group of imaginary quadratic fields (or briefly, class group). …”
Get full text