227 search results - page 42 / 46 » On the Reachability Problem in Cryptographic Protocols |
ACSAC
2000
IEEE
13 years 12 months ago
2000
IEEE
The widespread use of public networks, such as the Internet, for the exchange of sensitive data, like legally valid documents and business transactions, poses severe security cons...
ACISP
2000
Springer
13 years 11 months ago
2000
Springer
We present a new identification scheme which is based on Legendre symbols modulo a certain hidden prime and which is naturally suited for low power, low memory applications. 1 Ove...
23
Voted
CCS
2006
ACM
13 years 11 months ago
2006
ACM
Consider a pollster who wishes to collect private, sensitive data from a number of distrustful individuals. How might the pollster convince the respondents that it is trustworthy?...
CORR
2010
Springer
13 years 7 months ago
2010
Springer
Reactive routing protocols like Ad-hoc On-Demand Distance Vector Routing (AODV) and Dynamic Source Routing in Ad-Hoc Wireless Networks (DSR) which are used in Mobile and Ad-hoc Ne...
ASIACRYPT
2010
Springer
13 years 5 months ago
2010
Springer
We introduce and formally define polynomial commitment schemes, and provide two efficient constructions. A polynomial commitment scheme allows a committer to commit to a polynomial...