Sciweavers

1769 search results - page 300 / 354
» Cryptography
Sort
View
INFORMATICALT
2000
93views more  INFORMATICALT 2000»
13 years 9 months ago
A Secure Nonrepudiable Threshold Proxy Signature Scheme with Known Signers
In the (t, n) proxy signature scheme, the signature, originally signed by a signer, can be signed by t or more proxy signers out of a proxy group of n members. Recently, an efficie...
Min-Shiang Hwang, Iuon-Chang Lin, Eric Jui-Lin Lu
CORR
1999
Springer
138views Education» more  CORR 1999»
13 years 9 months ago
A simple proof of the unconditional security of quantum key distribution
Quantum key distribution is the best known application of quantum cryptography. Previously proposed proofs of security of quantum key distribution contain various technical subtle...
Hoi-Kwong Lo
TIT
1998
127views more  TIT 1998»
13 years 9 months ago
The Art of Signaling: Fifty Years of Coding Theory
—In 1948 Shannon developed fundamental limits on the efficiency of communication over noisy channels. The coding theorem asserts that there are block codes with code rates arbit...
A. Robert Calderbank
CCS
2010
ACM
13 years 9 months ago
TAPS: automatically preparing safe SQL queries
We present the first sound program transformation approach for automatically transforming the code of a legacy web application to employ PREPARE statements in place of unsafe SQL...
Prithvi Bisht, A. Prasad Sistla, V. N. Venkatakris...
CORR
2010
Springer
131views Education» more  CORR 2010»
13 years 8 months ago
Ideal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
: We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding ...
Henry Cohn, Nadia Heninger