39 search results - page 7 / 8 » Tightness of the Security Bound of CENC |
ASIACRYPT
2006
Springer
15 years 2 months ago
2006
Springer
We introduce KFC, a block cipher based on a three round Feistel scheme. Each of the three round functions has an SPN-like structure for which we can either compute or bound the adv...
IPL
2006
14 years 10 months ago
2006
We study the problem of Perfectly Reliable Message Transmission (PRMT) and Perfectly Secure Message Transmission (PSMT) between two nodes S and R in an undirected synchronous netw...
73
Voted
FOCS
2000
IEEE
15 years 2 months ago
2000
IEEE
Shannon [Sha48, Sha49] in celebrated works had shown that n bits of shared key is necessary and sufficient to transmit n-bit classical information in an information-theoretically ...
CCS
2003
ACM
15 years 3 months ago
2003
ACM
We propose a new notion of cryptographic tamper evidence. A tamper-evident signature scheme provides an additional procedure Div which detects tampering: given two signatures, Div...
OOPSLA
2007
Springer
15 years 4 months ago
2007
Springer
We present a new technique, early phase termination, for eliminating idle processors in parallel computations that use barrier synchronization. This technique simply terminates ea...