Computer Scientists Achieve ‘Crown Jewel’ of Cryptography
"how to build iO using only multilinear maps that compute polynomials whose “degree” is 30 or less (meaning that every term is a product of at most 30 variables, counting repeats). Over the next couple of years, she, Sahai and other researchers gradually figured out how to bring the degree down even lower, until they were able to show how to build iO using just degree-3 multilinear maps."
"The only multilinear maps researchers knew how to build securely were those that computed polynomials of degree 2 or less."
"Since iO seemed to need degree-3 maps, but computer scientists only had secure constructions for degree-2 maps, what if there was something in between — a sort of degree-2.5 map?"
Comments
Post a Comment