1064 search results - page 168 / 213 » Cryptography from Anonymity |
144
click to vote
FSE
2005
Springer
15 years 10 months ago
2005
Springer
A T-function is a mapping from n-bit words to n-bit words in which for each 0 ≤ i < n, bit i of any output word can depend only on bits 0, 1, . . . , i of any input word. All ...
158
click to vote
HIP
2005
Springer
15 years 10 months ago
2005
Springer
In this paper, we propose a new class of Human Interactive Proofs (HIPs) that allow a human to distinguish one computer from another. Unlike traditional HIPs, where the computer is...
151
click to vote
ISPEC
2005
Springer
15 years 10 months ago
2005
Springer
A (t, n) threshold proxy signature scheme enables an original signer to delegate the signature authority to a proxy group of n member such that t or more than t proxy signers can ...
129
click to vote
PKC
2005
Springer
15 years 10 months ago
2005
Springer
Coppersmith, Franklin, Patarin, and Reiter show that given two RSA cryptograms xe mod N and (ax + b)e mod N for known constants a, b ∈ ZN , one can compute x in O(e log2 e) ZN -o...
139
click to vote
TCC
2005
Springer
15 years 10 months ago
2005
Springer
Definition of security under the framework of Environmental Security (a.k.a Network-Aware Security or Universally Composable Security) typically requires “extractability” of t...