Sciweavers

118 search results - page 14 / 24
» Ideal Secret Sharing Schemes from Permutations
Sort
View
CORR
2007
Springer
117views Education» more  CORR 2007»
13 years 8 months ago
Perfectly Secure Steganography: Capacity, Error Exponents, and Code Constructions
An analysis of steganographic systems subject to the following perfect undetectability condition is presented in this paper. Following embedding of the message into the covertext,...
Ying Wang, Pierre Moulin
DCC
2005
IEEE
14 years 8 months ago
XOR-based Visual Cryptography Schemes
A recent publication introduced a Visual Crypto (VC) system, based on the polarisation of light. This VC system has good resolution, contrast and colour properties. Mathematically,...
Pim Tuyls, Henk D. L. Hollmann, Jack H. van Lint, ...
CRYPTO
1992
Springer
168views Cryptology» more  CRYPTO 1992»
14 years 15 days ago
Threshold Schemes with Disenrollment
Blakley, Blakley, Chan and Massey conjectured a lower bound on the entropy of broadcast messages in threshold schemes with disenrollment. In an effort to examine the conjecture, w...
Bob Blakley, G. R. Blakley, Agnes Hui Chan, James ...
PKC
2010
Springer
210views Cryptology» more  PKC 2010»
14 years 11 days ago
Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem
Abstract. In this paper, we fully break the Algebraic Surface Cryptosystem (ASC for short) proposed at PKC’2009 [3]. This system is based on an unusual problem in multivariate cr...
Jean-Charles Faugère, Pierre-Jean Spaenleha...
TCC
2005
Springer
166views Cryptology» more  TCC 2005»
14 years 1 months ago
Adaptively-Secure, Non-interactive Public-Key Encryption
Adaptively-secure encryption schemes ensure secrecy even in the presence of an adversary who can corrupt parties in an adaptive manner based on public keys, ciphertexts, and secret...
Ran Canetti, Shai Halevi, Jonathan Katz