Sciweavers

3228 search results - page 125 / 646
» Computationally Sound Proofs
Sort
View
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
14 years 2 months ago
Universal Accumulators with Efficient Nonmembership Proofs
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...
Jiangtao Li, Ninghui Li, Rui Xue
CORR
2008
Springer
127views Education» more  CORR 2008»
13 years 10 months ago
Branching proofs of infeasibility in low density subset sum problems
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 ...
Gábor Pataki, Mustafa Tural
KIVS
2007
Springer
14 years 4 months ago
A Proof of Concept Implementation of SSL/TLS Session-Aware User Authentication (TLS-SA)
Abstract Most SSL/TLS-based e-commerce applications employ conventional mechanisms for user authentication. These mechanisms—if decoupled from SSL/TLS session establishment—are...
Rolf Oppliger, Ralf Hauser, David A. Basin, Aldo R...
MFCS
1994
Springer
14 years 2 months ago
A Proof System for Asynchronously Communicating Deterministic Processes
We introduce in this paper new communication and synchronization constructs which allow deterministic processes, communicating asynchronously via unbounded FIFO bu ers, to cope wi...
Frank S. de Boer, M. van Hulst
JSCIC
2010
57views more  JSCIC 2010»
13 years 4 months ago
A Proof of the Stability of the Spectral Difference Method for All Orders of Accuracy
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...
Antony Jameson