849 search results - page 3 / 170 » Completely Non-malleable Schemes |
COMCOM
1999
13 years 5 months ago
1999
We present a problem of commonly used characterization sequences (CS) for the protocol conformance testing and propose a new test sequence to resolve the problem. The proposed tes...
CVPR
2011
IEEE
13 years 26 days ago
2011
IEEE
This paper presents a complete solution to estimating a scene’s 3D geometry and appearance from multiple 2D images by using a statistical inverse ray tracing method. Instead of ...
ICALP
2005
Springer
13 years 11 months ago
2005
Springer
Abstract An encryption scheme is non-malleable if the adversary cannot transform a ciphertext into one of a related message under the given public key. Although providing a very st...
JACM
2002
13 years 5 months ago
2002
In completely symmetric systems that have homogeneous nodes (hosts, computers, or processors) with identical arrival processes, an optimal static load balancing scheme does not in...
CPC
2008
13 years 4 months ago
2008
Abstract. Zeilberger's enumeration schemes can be used to completely automate the enumeration of many permutation classes. We extend his enumeration schemes so that they apply...