3228 search results - page 125 / 646 » Computationally Sound Proofs |
105
click to vote
ACNS
2007
Springer
15 years 7 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...
106
click to vote
CORR
2008
Springer
15 years 3 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 ...
122
click to vote
KIVS
2007
Springer
15 years 9 months 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...
165
click to vote
MFCS
1994
Springer
15 years 7 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...
128
click to vote
JSCIC
2010
14 years 10 months ago
2010
While second order methods for computational simulations of fluid flow provide the basis of widely used commercial software, there is a need for higher order methods for more accur...