Cryptographic Schemes Based on the ASASA Structure: Black-Box, White-Box, and Public-Key
In this paper we pick up an old challenge to design public key or white-box constructions
from symmetric cipher components. We design several encryption schemes based on the …
from symmetric cipher components. We design several encryption schemes based on the …
Non-interactive zero-knowledge from LPN and MQ
We give the first construction of non-interactive zero-knowledge (NIZK) arguments from post-
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …
quantum assumptions other than Learning with Errors. In particular, we achieve NIZK under …
General linear group action on tensors: A candidate for post-quantum cryptography
Starting from the one-way group action framework of Brassard and Yung (Crypto'90), we
revisit building cryptography based on group actions. Several previous candidates for one …
revisit building cryptography based on group actions. Several previous candidates for one …
The Legendre pseudorandom function as a multivariate quadratic cryptosystem: security and applications
Sequences of consecutive Legendre and Jacobi symbols as pseudorandom bit generators
were proposed for cryptographic use in 1988. Major interest has been shown towards …
were proposed for cryptographic use in 1988. Major interest has been shown towards …
Key-recovery attacks on ASASA
The ASASA ASASA construction is a new design scheme introduced at Asiacrypt 2014 by
Biryukov, Bouillaguet and Khovratovich. Its versatility was illustrated by building two public …
Biryukov, Bouillaguet and Khovratovich. Its versatility was illustrated by building two public …
Critical perspectives on provable security: Fifteen years of" another look" papers
Contents Page 1 CRITICAL PERSPECTIVES ON PROVABLE SECURITY: FIFTEEN YEARS OF
“ANOTHER LOOK” PAPERS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We give an …
“ANOTHER LOOK” PAPERS NEAL KOBLITZ AND ALFRED MENEZES Abstract. We give an …
Degree of regularity for HFEv and HFEv
In this paper, we first prove an explicit formula which bounds the degree of regularity of the
family of HFEv (“HFE with vinegar”) and HFEv-(“HFE with vinegar and minus”) multivariate …
family of HFEv (“HFE with vinegar”) and HFEv-(“HFE with vinegar and minus”) multivariate …
Practical and post-quantum authenticated key exchange from one-way secure key encapsulation mechanism
This paper discusses how to realize practical post-quantum authenticated key exchange
(AKE) with strong security, ie, CK+ security (Krawczyk, CRYPTO 2005). It is known that …
(AKE) with strong security, ie, CK+ security (Krawczyk, CRYPTO 2005). It is known that …
Pseudo flawed-smudging generators and their application to indistinguishability obfuscation
Abstract We introduce Pseudo Flawed-smudging Generators (PFGs). A PFG is an
expanding function whose outputs $\mathbf Y $ satisfy a weak form of pseudo-randomness …
expanding function whose outputs $\mathbf Y $ satisfy a weak form of pseudo-randomness …
Polly cracker, revisited
MR Albrecht, P Farshim, JC Faugere… - International conference on …, 2011 - Springer
We initiate the formal treatment of cryptographic constructions (“Polly Cracker”) based on the
hardness of computing remainders modulo an ideal over multivariate polynomial rings. We …
hardness of computing remainders modulo an ideal over multivariate polynomial rings. We …