We introduce Ad Hoc Anonymous Identification schemes, a new multi-user cryptographic primitive that allows participants from a user population to form ad hoc groups, and then prove...
Yevgeniy Dodis, Aggelos Kiayias, Antonio Nicolosi,...
We consider the following "efficiently decodable" nonadaptive group testing problem. There is an unknown string x {0, 1}n with at most d ones in it. We are allowed to t...
Abstract. Bootstrap percolation on an arbitrary graph has a random initial configuration, where each vertex is occupied with probability p, independently of each other, and a deter...
We prove that, if V is an effectively given commutative valuation domain such that its value group is dense and archimedean, then the theory of all V -modules is decidable.
Gennadi Puninski, Vera Puninskaya, Carlo Toffalori
All binary projective codes of dimension up to 6 are classified. Information about the number of the codes with different minimum distances and different orders of automorphism gro...