Sciweavers

773 search results - page 38 / 155
» On Cryptographic Assumptions and Challenges
Sort
View
IJNSEC
2011
143views more  IJNSEC 2011»
14 years 9 months ago
Probable Security Proof of A Blind Signature Scheme over Braid Groups
In this paper, we reinvestigate the security analysis of blind signature scheme over braid groups proposed by Verma in 2008. A blind signature scheme is a cryptographic primitive ...
Girraj Kumar Verma
STOC
2009
ACM
167views Algorithms» more  STOC 2009»
16 years 2 months ago
On the complexity of communication complexity
We consider the following question: given a two-argument boolean function f, represented as an N ? N binary matrix, how hard is to determine the (deterministic) communication comp...
Eyal Kushilevitz, Enav Weinreb
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 8 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CRYPTO
2007
Springer
162views Cryptology» more  CRYPTO 2007»
15 years 8 months ago
Universally-Composable Two-Party Computation in Two Rounds
Round complexity is a central measure of efficiency, and characterizing the round complexity of various cryptographic tasks is of both theoretical and practical importance. We show...
Omer Horvitz, Jonathan Katz
CTRSA
2001
Springer
122views Cryptology» more  CTRSA 2001»
15 years 6 months ago
Password Authentication Using Multiple Servers
Safe long-term storage of user private keys is a problem in client/server systems. The problem can be addressed with a roaming system that retrieves keys on demand from remote cred...
David P. Jablon