132 search results - page 25 / 27 » Some Bounds and a Construction for Secure Broadcast Encrypti... |
EUROPKI
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. Anonymous secret sharing schemes allow a secret to be recovered from shares regardless of the identity of shareholders. Besides being interesting in its own right, this p...
STOC
2010
ACM
14 years 17 days ago
2010
ACM
In STOC’05, von Ahn, Hopper and Langford introduced the notion of covert computation. In covert computation, a party runs a secure computation protocol over a covert (or stegano...
EUROCRYPT
2005
Springer
14 years 1 months ago
2005
Springer
It is a standard result in the theory of quantum error-correcting codes that no code of length n can fix more than n/4 arbitrary errors, regardless of the dimension of the coding ...
ASIACRYPT
2000
Springer
14 years 1 days ago
2000
Springer
Abstract. In 1985 Fell and Diffie proposed constructing trapdoor functions with multivariate equations [11]. They used several sequentially solved stages. Another idea of building ...
CCS
2003
ACM
14 years 28 days ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...