Sciweavers

85 search results - page 16 / 17
» Commitment Schemes and Zero-Knowledge Protocols
Sort
View
CCS
2008
ACM
13 years 8 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
COCO
2007
Springer
88views Algorithms» more  COCO 2007»
14 years 16 days ago
A New Interactive Hashing Theorem
Interactive hashing, introduced by Naor, Ostrovsky, Venkatesan and Yung (CRYPTO ’92), plays an important role in many cryptographic protocols. In particular, it is a major compo...
Iftach Haitner, Omer Reingold
MICRO
2010
IEEE
202views Hardware» more  MICRO 2010»
13 years 1 months ago
Hardware Support for Relaxed Concurrency Control in Transactional Memory
Today's transactional memory systems implement the two-phase-locking (2PL) algorithm which aborts transactions every time a conflict happens. 2PL is a simple algorithm that pr...
Utku Aydonat, Tarek S. Abdelrahman
ARESEC
2011
117views more  ARESEC 2011»
12 years 6 months ago
Non-Parallelizable and Non-Interactive Client Puzzles from Modular Square Roots
—Denial of Service (DoS) attacks aiming to exhaust the resources of a server by overwhelming it with bogus requests have become a serious threat. Especially protocols that rely o...
Yves Igor Jerschow, Martin Mauve
SIGMOD
2000
ACM
159views Database» more  SIGMOD 2000»
13 years 10 months ago
DLFM: A Transactional Resource Manager
The DataLinks technology developed at IBM Almaden Research Center and now available in DB2 UDB 5.2 introduces a new data type called DATALINK for a database to reference and manag...
Hui-I Hsiao, Inderpal Narang