MAC aggregation resilient to DoS attacks

Kolesnikov, Vladimir; Lee, Wonsuck; Hong, Jihyung

doi:10.1109/smartgridcomm.2011.6102323

Cited by 9 publications

(10 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our second construction, the "staircase XOR", is a special case of the family considered in [KLH11]. In this work, we prove that it has stronger security properties than claimed in [KLH11], namely, that it is secure in the presence of message multiplicity.…”

Section: Related Workmentioning

confidence: 88%

“…To this effect, they prove security (in the sense of [KL08]) for a large class of aggregation functions, which are one-to-one and efficiently computable on their components (i.e. We note that their constructed family is not secure in the presence of message multiplicity, and counterexamples can be readily constructed (e.g., the [KL08] construction is a member of the family proven secure in [KLH11]). They also describe several interesting aggregation functions, such as XOR shifted in the staircase manner (shown on Figure 2), and discuss their DoS-resilient properties.…”

Section: Related Workmentioning

confidence: 99%

“…Kolesnikov et al [KLH11] and its full version [KL12] consider protection against denial-of-service (DoS) attacks and line transmission errors. Kolesnikov et al [KLH11] and its full version [KL12] consider protection against denial-of-service (DoS) attacks and line transmission errors.…”

Section: Related Workmentioning

confidence: 99%

“…As pointed out in [KLH11,KL12], existing AggMAC schemes [KL08, EFG + 10] are vulnerable to denial-of-service (DoS) attacks and simply to transmission errors. Indeed, a single incorrectly transmitted bit (i.e., which is not corrected by error-correction) invalidates authenticity of the entire set of messages.…”

Section: Constructionmentioning

confidence: 99%

“…Indeed, a single incorrectly transmitted bit (i.e., which is not corrected by error-correction) invalidates authenticity of the entire set of messages. [KLH11,KL12] prove security in the model of [KL08], and do not allow message multiplicity in AggMAC. In this work, we prove that specifically the "staircase" AggMAC is secure even if message multiplicity is allowed. This and other constructions of the family provide a useful trade off between message length and error isolation, so that a bit-error invalidates only a limited number of AggMAC-authenticated messages.…”

Section: Constructionmentioning

confidence: 99%

See 4 more Smart Citations

Security and Cryptography for Networks

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

PrefaceThe 8th Conference on Security and Cryptography for Networks (SCN 2012) was held in Amalfi, Italy, during September 5-7, 2012. This biennial conference has traditionally been held in Amalfi, with the exception of the fifth edition which was held in nearby Maiori.The world-wide use of computer networks, and in particular of the Internet, opens new challenges for the security of electronic and distributed transactions. Cryptography and information security must face both the theoretical and practical aspects of the above challenges, by providing concepts, techniques, applications, and practical experiences. The principal aim of SCN as a conference is to bring together researchers, practitioners, developers, and users interested in the above fields, to foster cooperation and to exchange techniques, tools, experiences, and ideas in the stunning Amalfi Coast setting.The conference received 72 submissions in a broad range of cryptography and security areas. The selection of papers was a difficult task. This year we received many high-quality submissions and 31 of them were accepted for publication in these proceedings on the basis of quality, originality, and relevance to the conference's scope.At least three Program Committee (PC) members-out of 28 world-renowned experts in the conference's various areas of interest-reviewed each submitted paper, while submissions co-authored by a PC member were subjected to the more stringent evaluation of five PC members.In addition to the PC members, many external reviewers joined the review process in their particular areas of expertise. We were fortunate to have this knowledgeable and energetic team of experts, and are deeply grateful to all of them for their hard and thorough work, which included a very active discussion phase-almost as long as the initial individual reviewing period. The paper submission, review, and discussion processes were effectively and efficiently made possible by the Web-Submission-and-Review software, written by Shai Halevi, and hosted by the International Association for Cryptologic Research (IACR). Many thanks to Shai for his assistance with the system's various features and for his constant availability.Given the perceived quality of the submissions, the PC decided also this year to give a Best-Paper Award, both to promote outstanding work in the fields of cryptography and information security and to keep encouraging high-quality submissions to SCN. "Deterministic Public Key Encryption and Identity-Based Encryption from Lattices in the Auxiliary-Input Setting" by Xiang Xie, Rue Xue, and Rui Zhang was conferred such distinction.The program was further enriched by the invited talks of Yuval Ishai (Technion, Israel) and Giuseppe Persiano (Università di Salerno, Italy), top experts on the subjects of the conference. VI PrefaceWe thank all the authors who submitted papers to this conference; the Organizing Committee members, colleagues, and student helpers for their valuable time and effort; and all the conference attendees who made this event a t...

show abstract

Section: Related Workmentioning

confidence: 88%

Section: Related Workmentioning

confidence: 99%

Section: Related Workmentioning

confidence: 99%

Section: Constructionmentioning

confidence: 99%

Section: Constructionmentioning

confidence: 99%

See 3 more Smart Citations

Security and Cryptography for Networks

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

Cipher feedback mode under go‐back‐N and selective‐reject protocols in error channels

Liang

Xiao

Özdemir

et al. 2012

Security Comm Networks

View full text Add to dashboard Cite

To produce ciphertexts, two modes of encryption are applied-block ciphers, which encrypt a fixed size block of plaintext at a time, and stream ciphers, which encrypt stream data, one or more bits at a time. As one of stream ciphers, the cipher feedback (CFB) mode is implemented by a block cipher via multiple stages, and in each stage, 1 bit or a number of bits of plaintext are encrypted at a time. Throughout this paper, the study will focus upon the error performance of the stream-based CFB under two sliding-window protocols, go-back-N and selective-reject, in an error channel in terms of throughput. We model the performance of the CFB in terms of application-level throughput and derive the number of stages needed to achieve the optimal throughput, under a given error rate in an error channel.

show abstract

MAC Aggregation with Message Multiplicity

Kolesnikov¹

2012

Lecture Notes in Computer Science

View full text Add to dashboard Cite

MAC aggregation resilient to DoS attacks

Cited by 9 publications

References 9 publications

Security and Cryptography for Networks

Security and Cryptography for Networks

Cipher feedback mode under go‐back‐N and selective‐reject protocols in error channels

MAC Aggregation with Message Multiplicity

Contact Info

Product

Resources

About