Sciweavers

77 search results - page 15 / 16
» On the Security of Pseudorandomized Information-Theoreticall...
Sort
View
STOC
2000
ACM
137views Algorithms» more  STOC 2000»
14 years 4 days ago
On the complexity of verifiable secret sharing and multiparty computation
We first study the problem of doing Verifiable Secret Sharing (VSS) information theoretically secure for a general access structure. We do it in the model where private channels b...
Ronald Cramer, Ivan Damgård, Stefan Dziembow...
IJNSEC
2010
143views more  IJNSEC 2010»
13 years 3 months ago
Nonce Generation For The Digital Signature Standard
Digital Signature Algorithm (DSA) is an underlying algorithm to form a signature in the Digital Signature Standard (DSS). DSA uses a new random number (or nonce) each time a signa...
Rajendra S. Katti, Rajesh G. Kavasseri
ICIP
2004
IEEE
14 years 10 months ago
Robust perceptual image hashing via matrix invariants
In this paper we suggest viewing images (as well as attacks on them) as a sequence of linear operators and propose novel hashing algorithms employing transforms that are based on ...
Mehmet Kivanç Mihçak, Ramarathnam Ve...
PAIRING
2009
Springer
119views Cryptology» more  PAIRING 2009»
14 years 3 months ago
Compact E-Cash and Simulatable VRFs Revisited
Abstract. Efficient non-interactive zero-knowledge proofs are a powerful tool for solving many cryptographic problems. We apply the recent Groth-Sahai (GS) proof system for pairing...
Mira Belenkiy, Melissa Chase, Markulf Kohlweiss, A...
FOCS
2008
IEEE
14 years 3 months ago
Leakage-Resilient Cryptography
We construct a stream-cipher SC whose implementation is secure even if a bounded amount of arbitrary (adaptively, adversarially chosen) information about the internal state of SC ...
Stefan Dziembowski, Krzysztof Pietrzak