43 search results - page 6 / 9 » On the Impossibility of Private Key Cryptography with Weakly... |
TCC
2007
Springer
14 years 1 months ago
2007
Springer
Abstract. We establish new lower bounds and impossibility results for noninteractive zero-knowledge proofs and arguments with set-up assumptions. – For the common random string m...
WAIFI
2007
Springer
14 years 1 months ago
2007
Springer
Kabastianskii, Krouk and Smeets proposed in 1997 a digital signature scheme based on random error-correcting codes. In this paper we investigate the security and the efficiency of ...
PKC
2004
Springer
14 years 25 days ago
2004
Springer
Abstract. In this paper, we examine issues related to the construction of identity-based threshold decryption schemes and argue that it is important in practice to design an identi...
APPROX
2004
Springer
14 years 27 days ago
2004
Springer
A quantum encryption scheme (also called private quantum channel, or state randomization protocol) is a one-time pad for quantum messages. If two parties share a classical random s...
FOCS
2002
IEEE
14 years 13 days ago
2002
IEEE
Randomization is vital in cryptography: secret keys should be randomly generated and most cryptographic primitives (e.g., encryption) must be probabilistic. As a bstraction, it is...