4850 search results - page 171 / 970 » Proof and Computation in Geometry |
173
click to vote
FOCS
2006
IEEE
16 years 16 days ago
2006
IEEE
Let Λ : {0, 1}n ×{0, 1}m → {0, 1} be a Boolean formula of size d, or more generally, an arithmetic circuit of degree d, known to both Alice and Bob, and let y ∈ {0, 1}m be a...
152
click to vote
ACNS
2007
Springer
15 years 10 months ago
2007
Springer
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
156
click to vote
CORR
2008
Springer
15 years 6 months ago
2008
Springer
We prove that the subset sum problem ax = x {0, 1}n (SUB) has a polynomial time computable certificate of infeasibility for all a with density at most 1/(2n), and for almost all ...
165
click to vote
KIVS
2007
Springer
16 years 19 days ago
2007
Springer
Abstract Most SSL/TLS-based e-commerce applications employ conventional mechanisms for user authentication. These mechanisms—if decoupled from SSL/TLS session establishment—are...
208
click to vote
MFCS
1994
Springer
15 years 10 months ago
1994
Springer
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...