搜索结果: 1-3 共查到“one-way permutations”相关记录3条 . 查询时间(0.011 秒)
Round-Optimal Fully Black-Box Zero-Knowledge Arguments from One-Way Permutations
One-way permutations zero-knowledge arguments black-box constructions
2018/11/8
In this paper, we revisit the round complexity of designing zero-knowledge (ZK) arguments via a black-box construction from minimal assumptions. Our main result implements a 4-round ZK argument for an...
Candidate One-Way Functions and One-Way Permutations Based on Quasigroup String Transformations
one-way functions one-way permutations quasigroup string transformations
2009/3/9
In this paper we propose a definition and construction of
a new family of one-way candidate functions RN : QN ! QN, where
Q = {0, 1, . . . , s−1} is an alphabet with s elements. Special instan...
Black-Box Extension Fields and the Inexistence of Field-Homomorphic One-Way Permutations
black-box fields generic algorithms homomorphic encryption one-way permutations
2008/9/10
The black-box field (BBF) extraction problem is, for a given field F, to determine a secret field element hidden in a black-box which allows to add and multiply values in F in the box and which report...