搜索结果: 1-12 共查到“密码学 linear complexity”相关记录12条 . 查询时间(0.094 秒)
Athena: A verifiable, coercion-resistant voting system with linear complexity
cryptographic protocols election schemes
2019/7/8
Seminal work by Juels, Catalano & Jakobsson delivered a verifiable, coercion-resistant voting system with quadratic complexity. This manuscript attempts to advance the state-of-the-art by delivering a...
Linear Complexity of A Family of Binary pq2 -periodic Sequences From Euler Quotients
Cryptography linear complexity binary sequences
2019/6/21
We first introduce a family of binary pq2pq2 -periodic sequences based on the Euler quotients modulo pqpq, where pp and qq are two distinct odd primes and pp divides q−1q−1. The minimal po...
Highly Efficient and Reusable Private Function Evaluation with Linear Complexity
Private function evaluation Secure 2-party computation Communication complexity
2018/5/28
Private function evaluation aims to securely compute a function f (x_1 , . . ., x_n ) without leaking any information other than what is revealed by the output, where f is a private input of one of th...
Boolean Searchable Symmetric Encryption with Worst-Case Sub-Linear Complexity
searchable encryption structured encryption sub-linear boolean search
2017/2/20
Recent work on searchable symmetric encryption (SSE) has focused on increasing its expressiveness. A notable example is the OXT construction (Cash et al., CRYPTO '13 ) which is the first SSE scheme to...
Linear Complexity of Designs based on Coordinate Sequences of LRS and on Digital Sequences of Matrix/Skew LRS Coordinate Sequences over Galois Ring
matrix linear congruent generator skew linear recurrent sequence pseudo-random sequences
2016/12/8
Here we continue investigation of linear complexity properties of different ways to generate
pseudo-random sequences over Galois field wich essentially involves linear recurrences over
Galois ring a...
An Algorithm for Counting the Number of $2^n$-Periodic Binary Sequences with Fixed $k$-Error Linear Complexity
Sequence Linear Complexity k-Error Linear Complexity
2016/12/7
The linear complexity and kk-error linear complexity of sequences are important measures of the strength of key-streams generated by stream ciphers. The counting function of a sequence complexity meas...
Low Linear Complexity Estimates for Coordinate Sequences of Linear Recurrences of Maximal Period over Galois Ring
linear recurrent sequence linear complexity/rank estimations pseudo-random sequences
2016/3/1
In this work we provide low rank estimations for coordinate sequences of linear recurrent sequences (LRS) of maximal period (MP) over Galois ring R=GR(pn,r), p≥5, r≥2, with numbers s such that s=kr+2,...
Mutual Private Set Intersection with Linear Complexity
Mutual Private Set Intersection Prime Representation
2012/3/28
A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protoco...
Mutual Private Set Intersection with Linear Complexity
Mutual Private Set Intersection Prime Representation
2011/6/9
A private set intersection (PSI) protocol allows players to obtain the intersection of their inputs. While in its unilateral version only the client can obtain the intersection, the mutual PSI protoco...
Private Function Evaluation with Linear Complexity
Private Function Evaluation Linear Complexity
2010/10/20
We consider the problem of private function evaluation (PFE) in the two-party setting. Here, informally, one party holds an input $x$ while the other holds (a circuit describing) a function $f$; the g...
Multi-Party Privacy-Preserving Set Intersection with Quasi-Linear Complexity
Privacy-preserving set operation privacy-preserving set intersection
2010/10/11
In this paper we describe the first multi-party protocol for securely computing the set intersection functionality with both the communication and the computation costs that are quasi-linear in the si...
Linear-Complexity Private Set Intersection Protocols Secure in Malicious Model
Linear-Complexity Private Intersection Protocols Secure Malicious Model
2010/9/9
Private Set Intersection (PSI) protocols allow one party (“client”) to compute an intersection of its input set with that of another party (“server”), such that the client learns nothing other than th...