Sciweavers

112 search results - page 19 / 23
» Short Randomizable Signatures
Sort
View
CCS
2008
ACM
13 years 9 months ago
Multisignatures secure under the discrete logarithm assumption and a generalized forking lemma
Multisignatures allow n signers to produce a short joint signature on a single message. Multisignatures were achieved in the plain model with a non-interactive protocol in groups ...
Ali Bagherzandi, Jung Hee Cheon, Stanislaw Jarecki
CIKM
2011
Springer
12 years 7 months ago
LogSig: generating system events from raw textual logs
Modern computing systems generate large amounts of log data. System administrators or domain experts utilize the log data to understand and optimize system behaviors. Most system ...
Liang Tang, Tao Li, Chang-Shing Perng
SIGMOD
2004
ACM
119views Database» more  SIGMOD 2004»
14 years 7 months ago
Lazy Query Evaluation for Active XML
In this paper, we study query evaluation on Active XML documents (AXML for short), a new generation of XML documents that has recently gained popularity. AXML documents are XML do...
Serge Abiteboul, Omar Benjelloun, Bogdan Cautis, I...
ICDCS
2008
IEEE
14 years 1 months ago
A Sophisticated Privacy-Enhanced Yet Accountable Security Framework for Metropolitan Wireless Mesh Networks
— Recently, multi-hop wireless mesh networks (WMNs) have attracted increasing attention and deployment as a low-cost approach to provide broadband Internet access at metropolitan...
Kui Ren, Wenjing Lou
LPAR
2007
Springer
14 years 1 months ago
Verifying Cryptographic Protocols with Subterms Constraints
Many analysis techniques and decidability results have been obtained for cryptographic protocols. However all of them consider protocols with limited procedures for the processing ...
Yannick Chevalier, Denis Lugiez, Michaël Rusi...