Sciweavers

250 search results - page 31 / 50
» Fixed Argument Pairings
Sort
View
CTRSA
2009
Springer
235views Cryptology» more  CTRSA 2009»
14 years 4 months ago
A Statistical Saturation Attack against the Block Cipher PRESENT
In this paper, we present a statistical saturation attack that combines previously introduced cryptanalysis techniques against block ciphers. As the name suggests, the attack is st...
Baudoin Collard, François-Xavier Standaert
CAISE
2009
Springer
14 years 4 months ago
Declarative versus Imperative Process Modeling Languages: The Issue of Understandability
Advantages and shortcomings of different process modeling languages are heavily debated, both in academia and industry, but little evidence is presented to support judgements. Wit...
Dirk Fahland, Daniel Lübke, Jan Mendling, Haj...
GLOBECOM
2008
IEEE
14 years 4 months ago
Two-Hop Secure Communication Using an Untrusted Relay: A Case for Cooperative Jamming
—We consider a source-destination pair that can communicate only through an unauthenticated intermediate relay node. In this two-hop communication scenario, where the cooperation...
Xiang He, Aylin Yener
ATAL
2007
Springer
14 years 4 months ago
The LOGIC negotiation model
Successful negotiators prepare by determining their position along five dimensions: Legitimacy, Options, Goals, Independence, and Commitment, (LOGIC). We introduce a negotiation ...
Carles Sierra, John K. Debenham
ACISP
2005
Springer
14 years 3 months ago
On the Possibility of Constructing Meaningful Hash Collisions for Public Keys
It is sometimes argued (as in [6]) that finding meaningful hash collisions might prove difficult. We show that at least one of the arguments involved is wrong, by showing that for...
Arjen K. Lenstra, Benne de Weger