163 search results - page 32 / 33 » Relaxing Chosen-Ciphertext Security |
TCC
2009
Springer
14 years 6 months ago
2009
Springer
The concept of witness-hiding suggested by Feige and Shamir is a natural relaxation of zero-knowledge. In this paper we identify languages and distributions for which many known co...
STOC
2006
ACM
14 years 6 months ago
2006
ACM
Many approximation algorithms have been presented in the last decades for hard search problems. The focus of this paper is on cryptographic applications, where it is desired to de...
MLG
2007
Springer
14 years 4 days ago
2007
Springer
As a fundamental problem in pattern recognition, graph matching has found a variety of applications in the field of computer vision. In graph matching, patterns are modeled as gr...
IPPS
2006
IEEE
14 years 20 hour ago
2006
IEEE
— Anycast is a communication paradigm that was first introduced to the suit of routing protocols in IPv6 networks. In anycast, a packet is intended to be delivered to one of the...
ML
2006
ACM
13 years 12 months ago
2006
ACM
Existing ML-like languages guarantee type-safety, ensuring memty and protecting the invariants of abstract types, but only within single executions of single programs. Distributed...