2576 search results - page 31 / 516 » The Complexity of Zero Knowledge |
107
click to vote
EUROCRYPT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. We introduce a notion of instance-dependent verifiable random functions (InstD-VRFs for short). Informally, an InstD-VRF is, in some sense, a verifiable random function [...
DEXAW
1995
IEEE
15 years 3 months ago
1995
IEEE
Digital libraries can take advantage of documents that have their content (semantics) explicitly represented as knowledge structures. These knowledge-rich documents can be created ...
ICASSP
2009
IEEE
15 years 6 months ago
2009
IEEE
The common zeros problem for blind system identification (BSI) is well known. It degrades the performance of classic BSI algorithms and therefore imposes the limit on the perform...
ISTA
2007
15 years 1 months ago
2007
: With the ever-growing availability of so-called complex data, especially on the Web, decision-support systems such as data warehouses must store and process data that are not onl...
WEBI
2005
Springer
15 years 5 months ago
2005
Springer
As the number of web services in repositories on the World Wide Web increases so will the number of complex configurations of web services. However, as the World Wide Web is dynam...