Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
For generalized Reed-Solomon codes, it has been proved [7] that the problem of determining if a received word is a deep hole is coNP-complete. The reduction relies on the fact that...
We consider the following problem in a stream model: Given a sequence a = a1, a2, . . . , am wich each ai ∈ [n] = {1, . . . , n} and m > n, find a duplicate in the sequence, ...
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
Abstract. We investigate the group key management problem for broadcasting applications. Previous work showed that, in handling key updates, batch rekeying can be more cost-effect...
Minming Li, Ze Feng, Ronald L. Graham, Frances F. ...