184 search results - page 25 / 37 » Querying Proofs |
120
Voted
ISW
2007
Springer
15 years 8 months ago
2007
Springer
Abstract. We study the provable security of identity-based (ID-based) key agreement protocols. Although several published protocols have been proven secure in the random oracle mod...
121
Voted
TAMC
2007
Springer
15 years 8 months ago
2007
Springer
Pass observed that universal composable zero-knowledge (UCZK) protocols in the common reference string (CRS) model, where a common reference string is selected trustily by a truste...
126
click to vote
PODS
1997
ACM
15 years 6 months ago
1997
ACM
We rework parts of the classical relational theory when the underlying domain is a structure with some interpreted operations that can be used in queries. We identify parts of the...
157
Voted
TDM
2004
15 years 3 months ago
2004
This work may be seen as a further proof of the versatility of the relational database model. Here, we add XQuery to the catalog of languages which RDBMSs are able to "speak&...
96
Voted
ECCC
2010
15 years 1 months ago
2010
A linear code is said to be affine-invariant if the coordinates of the code can be viewed as a vector space and the code is invariant under an affine transformation of the coordin...