Sciweavers

18 search results - page 4 / 4
» Resettable Zero Knowledge in the Bare Public-Key Model under...
Sort
View
FOCS
1999
IEEE
13 years 11 months ago
Non-Malleable Non-Interactive Zero Knowledge and Adaptive Chosen-Ciphertext Security
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...
Amit Sahai
CRYPTO
2006
Springer
112views Cryptology» more  CRYPTO 2006»
13 years 11 months ago
On Signatures of Knowledge
In a traditional signature scheme, a signature on a message m is issued under a public key PK, and can be interpreted as follows: "The owner of the public key PK and its corr...
Melissa Chase, Anna Lysyanskaya
TCC
2007
Springer
102views Cryptology» more  TCC 2007»
14 years 1 months ago
Universally Composable Security with Global Setup
Abstract. Cryptographic protocols are often designed and analyzed under some trusted set-up assumptions, namely in settings where the participants have access to global information...
Ran Canetti, Yevgeniy Dodis, Rafael Pass, Shabsi W...