71 search results - page 6 / 15 » Securing Threshold Cryptosystems against Chosen Ciphertext A... |
TCC
2005
Springer
14 years 14 days ago
2005
Springer
A complexity-theoretic model for public-key steganography with active attacks is introduced. The notion of steganographic security against adaptive chosen-covertext attacks (SS-CC...
PKC
2004
Springer
14 years 10 days ago
2004
Springer
In a practical system, a message is often encrypted more than once by different encryptions, here called multiple encryption, to enhance its security. Additionally, new features ...
ACNS
2004
Springer
14 years 12 days ago
2004
Springer
We study the data privacy of cryptosystems with All-or-Nothing transform (AONT). An AONT is an efficient computable transform with two properties: Given all the bits of its output...
FOCS
1999
IEEE
13 years 11 months ago
1999
IEEE
We introduce the notion of non-malleable noninteractive zero-knowledge (NIZK) proof systems. We show how to transform any ordinary NIZK proof system into one that has strong non-m...
TYPES
2004
Springer
14 years 10 days ago
2004
Springer
Abstract. Most approaches to the formal analysis of cryptography protocols make the perfect cryptographic assumption, which entails for example that there is no way to obtain knowl...