Advances in Computer Science - ASIAN 2009. Information by Jean Goubault-Larrecq (auth.), Anupam Datta (eds.)

By Jean Goubault-Larrecq (auth.), Anupam Datta (eds.)

This e-book constitutes the refereed court cases of the thirteenth Asian Computing technological know-how convention, ASIAN 2009, held in Seoul, Korea, in December 2009.

The 7 revised complete papers and three revised brief papers provided including 2 invited talks have been rigorously reviewed and chosen from forty five submissions. concentrating on the idea and perform of data defense and privateness, the papers contain issues of deducibility constraints, symmetric encryption modes, dynamic safety domain names and regulations, cryptography, formal verification of quantum courses, selection of static equivalence, authenticated message and proxy signature scheme.

Show description

Read or Download Advances in Computer Science - ASIAN 2009. Information Security and Privacy: 13th Asian Computing Science Conference, Seoul, Korea, December 14-16, 2009. Proceedings PDF

Best science books

The Blind Spot: Science and the Crisis of Uncertainty

In today's unpredictable and chaotic global, we glance to technology to supply sure bet and answers--and frequently blame it while issues get it wrong. The Blind Spot unearths why our religion in medical simple task is a deadly phantasm, and the way in simple terms by way of embracing science's inherent ambiguities and paradoxes do we actually savour its good looks and harness its capability.

Elephants on Acid

Have you puzzled if a severed head keeps awareness lengthy adequate to work out what occurred to it? Or no matter if your puppy might run to fetch support, when you fell down a disused mineshaft? And what may occur in the event you have been to provide an elephant the biggest ever unmarried dose of LSD? the probabilities are that somebody, someplace has carried out a systematic scan to determine.

Isaac Asimov: The Foundations of Science Fiction

Updates and expands technology fiction student James Gunn's definitive, Hugo Award-winning severe quantity approximately Isaac Asimov and his contributions to the technology fiction style.

Portal Combat (Ted Saves the World, Book 3)

Because the obstacles among worlds begin to crumble…
…superhero Ted Finley needs to conflict his maximum enemy yet.
After a summer time spent retaining the weak from average failures, Ted couldn't be extra excited to come domestic for his senior yr of highschool. whereas he goals of teaching with and relationship his protector, Erica LaPlante, existence as a teenage superhero keeps to get more durable. A crafty presidential candidate, a disgruntled gatekeeper among nation-states, and typical villains threaten to finish Ted and Erica's project, in addition to the world.

When a brand new and strong enemy emerges, Ted and Erica needs to pick out their allies properly to maintain a dangerous military at bay. in the event that they fail, the folks they recognize and love will locate themselves on a planet-wide battlefield.

Portal strive against is the 3rd novel in a YA sci-fi/fantasy sequence that includes action-packed struggle scenes, terrifying villains, witty banter, and a pinch of middle. writer Bryan Cohen's Ted Saves the area sequence keeps to develop in scope and pleasure in his 3rd installment.

Additional resources for Advances in Computer Science - ASIAN 2009. Information Security and Privacy: 13th Asian Computing Science Conference, Seoul, Korea, December 14-16, 2009. Proceedings

Example text

Related Work: Security of symmetric encryption modes have been studied for a long time by the cryptographers. In [1] the authors presented different concrete security notions for symmetric encryption in a concrete security framework. For instance, they give a security analysis of CBC mode. In [2] a security analysis of the encryption mode CBC-MAC [21]. In [26] they propose a new encryption mode called OCB for efficient authenticated encryption and provide a security analysis of this new mode. Many other works present proofs of encryption modes.

We do not provide rules for the commands x := E −1 (y) or x := y[n, m] since those commands are only used during decryption. Notation: For a set V , we write V, x as a shorthand for V ∪ {x}, V − x as a shorthand for V \ {x}, and Indis(νx) as a shorthand for Indis(νx; Var). Random Assignment: $ – (R1) {true} x ← − U {F (x) ∧ Indis(νx) ∧ E(E, x)} $ – (R2) {Indis(νy; V )} x ← − U {Indis(νy; V, x)} Increment: – (I1) {F (y)} x := y + 1 {RCounter(x) ∧ E(E, x)} – (I2) {RCounter(y)} x := y + 1 {RCounter(x) ∧ E(E, x)} – (I3) {Indis(νz; V )} x := y + 1 {Indis(νz; V − x)} if z = x, y and y ∈ V Xor operator: – (X1) {Indis(νy; V, y, z)}x := y ⊕ z{Indis(νx; V, x, z)} where x, y, z ∈ V , – (X2) {Indis(νy; V, x)}x := y ⊕ z{Indis(νy; V )} where x ∈ V , – (X3) {Indis(νt; V, y, z)} x := y ⊕ z {Indis(νt; V, x, y, z)} if t = x, y, z and x, y, z ∈ V – (X4) {F (y)} x := y ⊕ z {E(E, x)} if y = z Concatenation: – (C1) {Indis(νy; V, y, z)} ∧ {Indis(νz; V, y, z)} x := y z {Indis(νx; V, x)} if y, z ∈ V – (C2) {Indis(νt; V, y, z)} x := y z {Indis(νt; V, x, y, z)} if t = x, y, z Block cipher: – (B1) {E(E, y)} x := E(y) {F (x) ∧ Indis(νx) ∧ E(E, x)} – (B2) {E(E, y) ∧ Indis(νz; V )} x := E(y) {Indis(νz; V )} provided z = x Automated Security Proof for Symmetric Encryption Modes 47 – (B3) {E(E, y) ∧ Rcounter(z)} x := E(z) {Rcounter(z)} provided z = x – (B4) {E(E, y) ∧ E(E, z)} x := E(y) {E(E, z)} provided z = x, y – (B5) {E(E, y) ∧ F (z)} x := E(y) {F (z)} provided z = x, y Finally, we add a few rules whose purpose is to preserve invariants that are unaffected by the command.

If D is a constraint system that is uniquely determined and σ ∈ Sol(D), then there is a solved deducibility constraint D such that D ∗ D and σ ∈ Sol(D ). We assume that mgu(E ∪ θ) = ⊥. F∧H v1 ∧ . . ∧ H vm where: v1 . . vm w1 . . wn is a decomposition or a versatile rule such that w Max(R) ⊆ {w1 , . . , wn } and x ˜ = var (R); – θ = mgu( w, w1 , . . , wn , v, u1 , . . , un ), u1 , . . , un ∈ st(H) X , and v ∈ X ; – H is a left member of a deducibility constraint in A such that H H; – mgu(E ∪ θ) = ⊥ and lev(x, A ∧ H v) < lev(H, A ∧ H v) for any x ∈ var (v).

Download PDF sample

Rated 4.41 of 5 – based on 24 votes