Sciweavers

324 search results - page 63 / 65
» A new signature scheme without random oracles
Sort
View
EUROCRYPT
2004
Springer
13 years 11 months ago
On Generating the Initial Key in the Bounded-Storage Model
Abstract. In the bounded-storage model (BSM) for information-theoretically secure encryption and key-agreement one uses a random string R whose length t is greater than the assumed...
Stefan Dziembowski, Ueli M. Maurer
CANS
2006
Springer
136views Cryptology» more  CANS 2006»
13 years 10 months ago
Watermarking Essential Data Structures for Copyright Protection
Software watermarking is a new research area that aims at providing copyright protection for commercial software. It minimizes software piracy by hiding copyright signatures inside...
Qutaiba Albluwi, Ibrahim Kamel
ALENEX
2010
156views Algorithms» more  ALENEX 2010»
13 years 7 months ago
Tabulation Based 5-Universal Hashing and Linear Probing
Previously [SODA'04] we devised the fastest known algorithm for 4-universal hashing. The hashing was based on small pre-computed 4-universal tables. This led to a five-fold i...
Mikkel Thorup, Yin Zhang
INFOCOM
2009
IEEE
14 years 27 days ago
Network Coding Meets TCP
—We propose a mechanism that incorporates network coding into TCP with only minor changes to the protocol stack, thereby allowing incremental deployment. In our scheme, the sourc...
Jay Kumar Sundararajan, Devavrat Shah, Muriel M&ea...
JSA
2007
191views more  JSA 2007»
13 years 6 months ago
Automated memory-aware application distribution for Multi-processor System-on-Chips
Mapping of applications on a Multiprocessor System-on-Chip (MP-SoC) is a crucial step to optimize performance, energy and memory constraints at the same time. The problem is formu...
Heikki Orsila, Tero Kangas, Erno Salminen, Timo D....