Sciweavers

62 search results - page 7 / 13
» Zero-Knowledge Sets with Short Proofs
Sort
View
ACNS
2007
Springer
96views Cryptology» more  ACNS 2007»
14 years 16 days ago
Universal Accumulators with Efficient Nonmembership Proofs
Based on the notion of accumulators, we propose a new cryptographic scheme called universal accumulators. This scheme enables one to commit to a set of values using a short accumul...
Jiangtao Li, Ninghui Li, Rui Xue
CSL
2010
Springer
13 years 9 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
HICSS
2003
IEEE
193views Biometrics» more  HICSS 2003»
14 years 1 months ago
Message Sense Maker: Engineering a Tool Set for Customer Relationship Management
To determine the important trends and issues in thousands of comments from customers and make strategic decisions about business operations, managers must go over these messages m...
Dmitri Roussinov, J. Leon Zhao
DCC
2005
IEEE
14 years 8 months ago
The Combinatorics of Dom de Caen
We give an overview of some of the mathematical results of Dominique de Caen. These include a short proof of K?onig's theorem, results on Tur?an numbers, biclique partitions,...
Edwin R. van Dam
COCOON
2007
Springer
14 years 2 months ago
The Informational Content of Canonical Disjoint NP-Pairs
We investigate the connection between propositional proof systems and their canonical pairs. It is known that simulations between proof systems translate to reductions between the...
Christian Glaßer, Alan L. Selman, Liyu Zhang