Information sharing across private databases

R Agrawal, A Evfimievski, R Srikant - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
Literature on information integration across databases tacitly assumes that the data in each
database can be revealed to the other databases. However, there is an increasing need for …

[PDF][PDF] Security and privacy in radio-frequency identification devices

SA Weis - 2003 - dspace.mit.edu
Abstract Radio Frequency Identification (RFID) systems are a common and useful tool in
manufacturing, supply chain management and retail inventory control. Optical barcodes …

QC-Trees: An efficient summary structure for semantic OLAP

LVS Lakshmanan, J Pei, Y Zhao - Proceedings of the 2003 ACM …, 2003 - dl.acm.org
Recently, a technique called quotient cube was proposed as a summary structure for a data
cube that preserves its semantics, with applications for online exploration and visualization …

Analysis of affine equivalent Boolean functions for cryptography

JE Fuller - 2003 - eprints.qut.edu.au
Boolean functions are an important area of study for cryptography. These functions,
consisting merely of one's and zero's, are the heart of numerous cryptographic systems and …

A New-Complete Problem and Public-Key Identification

D Pointcheval, G Poupard - Designs, Codes and Cryptography, 2003 - Springer
The appearance of the theory of zero-knowledge, presented by Goldwasser, Micali and
Rackoff in 1985, opened a way to secure identification schemes. The first application was …

Evolutionary generation of bent functions for cryptography

J Fuller, E Dawson, W Millan - The 2003 Congress on …, 2003 - ieeexplore.ieee.org
We present a new heuristic algorithm that efficiently generates Boolean Bent functions,
which have desirable cryptographic properties including maximum nonlinearity. By using an …

Architectural techniques for accelerating subword permutations with repetitions

JP McGregor, RB Lee - IEEE transactions on very large scale …, 2003 - ieeexplore.ieee.org
We propose two new instructions, swperm and sieve, that can be used to efficiently complete
an arbitrary bit-level permutation of an n-bit word with or without repetitions. Permutations …

Secure block ciphers are not sufficient for one-way hash functions in the Preneel-Govaerts-Vandewalle model

S Hirose - Selected Areas in Cryptography: 9th Annual …, 2003 - Springer
There are many proposals of unkeyed hash functions based on block ciphers. Preneel,
Govaerts and Vandewalle, in their CRYPTO'93 paper, presented the general model of …

Attacks for finding collision in reduced versions of 3-pass and 4-pass HAVAL

YS Her, K Sakurai, SH Kim - Proc. of 2003 International …, 2003 - catalog.lib.kyushu-u.ac.jp
HAVAL is a hash function, which was proposed by Zheng et al. HAVAL has the first flexiable
variable output lengths, namely 128, 160, 192, 224 or 256 bits, and consists of 3-pass, 4 …

[PDF][PDF] Cryptanalysis and design of block ciphers

B Preneel, J Vandewalle, JN Júnior - Leuven: Katholieke Universiteit …, 2003 - Citeseer
This thesis focuses on cryptanalysis techniques and design of block ciphers. In particular,
modern analysis methods such as square, boomerang, impossible differential and linear …