However, even when people are deeply ambivalent about the effects of technology, they often still talk about these effects as if they were inevitable.

a recent issue of Forbes magazine suggests that there is lively debate as to whether surveillance technology will bring on Orwell s 1984, or constitute a giant step toward human freedom ; yet, in the very next sentence, the author states [e]ither way, the damned thing is practically here.


While some complexity is unavoidable, our goal is manageable complexity.

we limit our use of diverse redundancy via N-version programming to modules and layers where it provides known and measurable improvements, and where formal methods cannot be applied (e.g., physical components and other analog failures).


when it is passed by registers but can not .t in only one of them.

loop data .ow parameter values have to be combined to build the high-level parameter value.


Furthermore, the CSI measurements of the wireless packets collected from another device resided at a di.erent location (Position 2) should form a di.erent cluster in the CSI space.

when the environment is benign, the CSI measurements from a particular device identity should be clustered together and form one cluster in the CSI space, while under the spoo.ng attack, the spoofer utilizes the same device identity as the legitimate user to transmit packets, and the CSI readings of the device identity are the mixture readings from both legitimate user and the spoofer, resulting in more than one CSI cluster.


The main reason for this is that routing messages are simply forwarded, without any changes, from one end to the other end of the tunnel.

without a satisfactory level of security, end users or organizations lack motivation to utilize the WMNs technology.


Now, for any function A1 (including ones which can leave the initial .ow unmodi.ed) the de.nition of look-ahead extractors ensures that the variables V =(X, Z), R = laExt(W ; X), R '' = laExt(W ; X ) satisfy the look-ahead property ((5) in De.nition 12).

de.nition 12 ensures that the probability of A2 successfully producing (µB ,s ) such that µB = µA and Bob accepts (µB ,s ) is upper-bounded by d. We now proceed to construct a MAC with look-ahead security.


The approach could implemented by understanding the algorithm used to unpack any samples.

these unpacking algorithm can be plugged to existing disassemblers/debugger which could assist in e.cient disassembling and debugging of samples being monitored.


Note that in some cases, an attacker may not care if he gets caught.

if the attack can succeed with non-negligible probability for even a single session, we consider the attack successful as a whole.


For an arbitrary attack, the symmetrization can improve Eve's final information on the common secret key (or leave it the same).

if the op-timal attack is asymmetric, there is also an equivalent sym- metric attack which is as good, hence also optimal.


(14) It is easy to see that f (y) = 0 at y = r/(a-b), and that f is concave.

we need to determine whether YT or y = r/(a - b) is larger.


The core functionality, which is expected by the analyst, is the calculation of the sum of the two operands EAX and EBX.

the new state of the machine after the execution of the instruction includes a modi.ed register EAX that now holds the sum of the registers EAX and EBX.


We must not traverse if the current ob ject is a shadow object because its .elds are actually taint tags.

we again need to test the shadow pointer against 0xffffffff before traversing.


(12) L L j=1 This means that the estimator is unbiased, which is de sirable.

when j .= k, E[ZjZk]= P(Zj =1,Zk =1) = Ni-1 P(Zj =1)P(Zk =1|Zj =1) = Ni · and E[Zj]E[Zk]= N N-1 2 )2 (pg(i))=( Ni .N Cov[Zj,Zk]= E[ZjZk] -E[Zj]E[Zk] (13) 1 -pg(i) = -pg(i) , (14) N -1 which leads to " # PL Zj Var[ pg(i)] = Var j=1 (15) L PL P Var[Zj]+ 2 Cov[Zj,Zk] j=1 j<k = (16) L2 1 N -L = · ·pg(i)(1 -pg(i)).


N communication scheme: a publisher is able to accept several subscriptions from different clients.

all consumers are noti.ed when issuing an event.


The sequence is repeated for each system call sci.The Pred GSCG guards each system call sci with an invariant gi.

there exists some ifor which executing the sequence mci,sci that overrides system call arguments with attacker s values instead of the sequence lci,sci consisting of the legitimate block of instruction lci preceding the system call sci will not follow the program execution paths from which gi has been generated and propagated and will violate gi that summarizes the data .ow in lci.


Note also that, when using passwords, the protocol is susceptible to password guessing attacks and the security of the presented scheme is upper bounded by the probability of guessing the password, i.e., 2-|D|, where |D| denotes the size of the password space.

the goal of BBSAML is to make the dictionary attack the best an attacker can do.


This work also points out that synthetic workloads need to replicate both volumetric and contextual properties of an execution environment in order to provide an accurate indication of a system s performance within that environment.

we conjecture that access control workloads as well may need to be capable of expressing not only volumetric statistics such as number of documents created, but also contextual statistics such as the type of content in created documents.


3.1 Exclusive access: Each pixel shall be mapped to at most one application.

an application that has access to a pixel is guaranteed to be visible.


They assume that network packets are defragmented and reassembled.

such approaches can not be directly employed to signature matching in multiple flows.


Over the time, the central server would require a huge database for storing these access permissions.

a central management is not practical when there is huge number of entities interact in the environment.


Given different provisioning data sets, a particular algorithm may show quite different performance from others, as we have veri.ed with our experiments (see Section 4).

at this step, it is important not only to train and tune classi.ers but also to compare their performance based on standard estimation methods, e.g., 10-fold cross validation.


In such situations, a site-speci.c white-list would help, but we have not added such white-lists because it would be di.cult for us to systematically decide for all 100 benchmarks what these white-lists should be.

as we do not use sitespeci.c white-lists, our policy violations may not correspond to undesirable .ows.


A better static importance-scanning strategy leads to a smaller Y.

the goal of the static importance scanning is to minimize Y.


Note that in the case of multiple channel jamming, it is possible for a node to be assigned to transmit on a jammed channel.

the total number of transmissions per slot that will not be jammed is equal to G - ., where .


We present a further attack, which compromises the ephemeral key-agreement.

we propose a new ephemeral key establishment protocol in this paper and provide a security analysis concerning the new protocol.


4.4 Attack Rationale The problem in utilizing .xes of this vulnerability lies in the fact that Eucalyptus is deployed on various and numerous privately hosted servers.

each Eucalyptus administrator has to manually update his server version.


If contentfrom both service providers are made available to the shared domain managed by the Domain Manager, enforcing Service Provider B s domain policy would violate Service Provider A s domain policy.

we advocate that the Domain Manager should enforce the most restrictive policy to allow for the sharing of content purchased from di.erent service providers.


There is no built-in policy that restricts access only to the same document.

our current implementationdoesnot remove theSameOriginPolicy,but instead makesan function getPublicInterface() { function Interface() { this.authenticate = function (username, password) { // Verify username and password, e.g.


To the best of our knowledge, previous studies mainly focused on obtaining limited information on aggregate botnet behaviors triggered by a single environment.

they may miss some potential botnet activities or even lose opportunities to discover C&C protocol vulnerabilities.


4, Windows-7 actually randomizes the kernel instruction address, and during the randomization some code and data labels (boxed in the .gure) for some instructions are changed as well.

we have to neutralize the randomization.


As shown in Figure 2(b-e), only the rough shape of the four dots is invariant under illumination and focus changes.

we binarize and segment the four dots before extracting the shape as the descriptor of the print signature.


The size of the .ngerprint input by Client intheprotocolis negligible comparedtothe size ofthe entire genome.

positions corresponding to Client input are affected by errors with extremelylowprobability.


De.ning a realistic scenario for phone placement is quite subjective but we assume that cell phone users often place their phones inside their trouser pocket.

when a user walks with a cell phone inside the pocket, the cell phone changes its orientation during the walk.


This is smaller than the 60 ns lower limit required to detect close range attacks by well funded attackers.

if the number of processing cycles that the prover requires to receive the veri.er s challenge bit and compute and modulate the response bit can be kept small, it may not be necessary to resort to UWB communication as Hanke and Kuhn have asserted.


Although format-string attacks do not involve a buffer over.ow, they share the key characteristic used in the analysis described above: namely, the forged pointer (i.e., attacker speci.ed pointer value such as M) occurs in the middle of attackerprovided data residing in a buffer.


This results in distribution of the message over the entire image randomly.

even if LSBs are removed and read, they do not convey any intelligent information.


Because of this we use a modi.ed de.nition of edge betweenness: CB (e)= P spathst(e) where pathst(e) is the number of BGP paths =t.V between IP blocks in s and t that use link e. Since each of these routes must be individually withdrawn, recomputed, and re-advertised this will provide an approximation of the number of BGP messages generated if the link were to fail.

target links are ranked in order of their BGP Betweenness .


4 Another advantage of using Integrity Trees that are relatively infrequently updated means that RSA veri.cations on the client side are amortized, as we envision that many domains will use the same set of ILSs, hence the root of the Integrity Tree will remain the same for numerous sites.

clients mostly only perform ef.cient hash tree veri.cations and only rarely perform signature veri.cations.


That is, in contrast to the technical evaluation, some participants of the usability study decided to use the accumulative input technique for EyePassShapes.

we performed an additional analysis splitting the results in two groups: one for those participants who had performed EyePassShapes in one stroke and one for those who used the accumulative method.


In particular, internal communication is required for many applications, and allows to reduce communication costs on the cloud, as well as latency for clients.

preventing our attacks, without adverse impact on cloud applications and tenants, requires further investigation.


All of these channels can introduce and distribute malicious code.

it is very common for end-users to possess known but not fully trusted binary code, or even unknown binaries that they are lured to run.


Signatures are expressed as Java-Script procedures that, at run-time, check the values provided as input to vulnerable components for conditions that indicate an attack.

phoneyC s signatures characterize the dynamic behavior of an exploit, rather than its syntactic features.


If A receives the value eph from T ' in each impersonation attempt, it correctly answers any challenges Ri = 1, and can guess the other responses.


The policy expression language, runtime system, and policy authors must ensure that statements of policy result in appropriate additions to or deletions from the authorization set of a resource.

high-level policy expressions may add many authorizations to the authorization set of a resource, while lowerlevel policy expressions e.ectively remove some of those authorizations.


Baton only introduces cryptographic veri.cation of certi.cate chains.

with Baton, an adversary must still compromise a developer s private signing key to issue an update or create a valid certi.cate chain to transition to a new signing certi.cate.


As outlined above, the concept discussed in this article focuses on TC services for Java applications.

most of the components outlined here are designed to be implemented in Java.


Figure 6(a), yields pseudonyms as formal objects, but messages instead of data items as formal attributes.

in the next step, we have to replace the formal attributes M , i.e.


However, this is much undesirable in the point of security.

scattering the PRNG states randomly in each application s startup is needed.


IPsec AH header), changing the destination IP address of outgoing tra.c may not always feasible.

dynamically setting the IP address of the virtual machine is a better way to deceive worm tra.c.


The lack of a threat model has prevented us from recognizing this and caused us to judge a technique based on a criteria that is measurable but has no relation to our actual needs.

although the challenges of e.ective movement can be discussed generally, their actual implementation and consideration in a technique can only make sense in the context of a threat model.


To synchronize one time password between user and OTP authentication server, the master key and seed value should be secret.

user should stop by the bank and gets the OTP generator(portable device) in offline.


Apparently, this implies a huge overhead of execution performance and space required for managing the related data structures.

most emulators use page fault handling for SMC detection.


The human genome contains detailed and extremely personal information, e.g., susceptibility to somatic and mental conditions as well as ethnicity and ancestry.

potential disclosure triggers fears of genetic discrimination, aka eugenism .


we could ¯ obtain CTI '' =(C,C ' ,C,C ' ), where C ' is obtained from the Reencrypt algorithm with the input of another RKI ' .I '' and C. The decryption cost and size of ciphertext grows linearly with the re-encryption times.


BEHAVIORAL ANALYSIS OF MPE SPAM According to our preliminary evaluation, we found that different spam-sending hosts showed similar time-series behavior, even if previous techniques such as DNSBL and content filters find such behavior difficult to handle.

we focused on the timeseries spam-sending behaviors of MPE spam-sending hosts.


Although nodes are probably equipped with several hundred pseudonym certi.cates valid for the same time, it is assumed that every node stores the related private keys in a tamper resistant storage.

the keys cannot be read by arbitrary users and system functions.


If Alice has this attribute, then she likely protects it with an access control policy.

as a response, Alice will ask the resource provider to satisfy her policy.


In Section 6.2 we evaluate various such cleaning techniques.

however, LPT cannot be used for tracking keystrokes.


However, when the authorized duration for a recipient expires, it is necessary to change the common group key into a new key in order to prevent the leaving customer from having access to the content beyond the limit of his authorized duration.

the sender has to share the new TEK with all legitimate recipients except the leaving one.


Hence, we incorporate these factors by denoting the function as fv.

the biometric templates r and q are functions of variability factors as shown in Equations 1 and 2 below: r = r(v)= fv(R(v)) (1) ' ' q = q(v)= fv.


The favor of direct experiences over recommendations is due to the fact that entities tend to rely on their own experiences more than on others recommendations [13].

an entity can make a trust decision based on the overall reputation (ORep) of the trustee.


Although all such permissions are at the dangerous level, they are also extensively requested by popular apps such as Ebay, Expedia, Facebook and Whatsapp.

we believe that claiming them by the malicious app will not arouse much suspicion.


For Type II attacker, we shift the semi-functionality from the master secret key to the secret value used to setup the public key.

the master secret key is always normal and can be given to the Type II attacker.


claim (computational) resilience t = N.As we will see, this claim is unfounded and the scheme can be broken by an attacker who compromises t +3 = 80 nodes.

we conclude that the scheme of Zhang et al.


Moreover, accompanying participants hoping to observe their mobile networking activity would have been logistically difficult: people may use an application such as mobile Facebook at any time anywhere, and an observer might have to spend many hours with a participant before witnessing some activity, having to invade their privacy for a prolonged period of time.

we decided to gather data about participant s mobile Facebook activity by combining two methods: .


At the same time, there is a performance implication and potential for loss in the quality of data fidelity (e.g., due to transformations).

the use of I/E/T filters should be considered in conjunction with application performance and data accuracy.


Based on our observation, the average length of an Intel x86 instruction is between 2.1-2.8.

in theory, a 16-gram byte test would be neededto reliablygenerate signaturesforan M8 mimimorphic malware.


Since Fj-1f-2 is a product of at most 2N small polynomials, it ij has .8 norm at most (nB)2N , by Corollary 3.3.

the error is at most errorj = 2 · n · (nB)2N · 2n(.log q.


The number of actual disks dused by S might be different than the number of agreed-upon drives c. The actual .le placement {Dj}dj=1 performed by the server might also deviate arbitrarily from the placement speci.ed by the Map function.

(As we discuss later, sophisticated adversaries might even store something other than unmodi.ed blocks of G.) At the beginning of a protocol execution, we assume that no blocks of G are stored in the high-speed (non-disk) memory of S. to respond to a challenge Q, S must query its disks to retrieve .le blocks.


Enterprises need to specify more precisely which operations should be permitted to whom on which document.

usage control on sensitive information needs not only to be able to de.ne who has access at all, but also enable detailed speci.cation of the individual rights on the business data for the given users.


Then, the backward ant follows the same path as its corresponding forward ant, but in the reverse direction.

in contrast to the forward ant, the itinerary of the backward ant is determined at its originator node which is the destination of the corresponding forward ant.


.. We may note that the de.nition of GWU is insensitive to the initial state of the machine.

if the existence of a GWU is sound evidence for X-security, then it is also sound evidence for P-Xsecurity.


If the key KD is lost and cannot be recovered, it follows that the domain content on the backup cannot be decrypted.


However, we also point out that this ideal solution is not completely feasible, due to the limitation of the current technologies related to visualization.

it is essential for the system to identify whether the visual integrity is in danger; if it is, the system should restrict the access.


For practical deployment, it is critical that the TLS connection establishment does not incur any additional latency.

the additional RTT incurred by OCSP, P/C/CC, and SK is problematic.


However, such a scenario rarely happens when the number of .ows is large.

the behavior of the DLP heuristic tends to be similar to the constant padding algorithm when the number of .ows is large.


Also, observe that the combination of the hierarchical structure H and the bu.er C contains information about the up-to-date copy of all blocks.

we can intuitively conclude that as long as the above invariant is maintained, our audits can detect any data loss with overwhelming probability.


As observed in our study, it is quite common that a user tends to upload edited images where facial landmarks are signi.cant changed to create better visual appeal.

it is also an important factor that needs to be considered.


In addition, the number of collisions signi.cantly increased for the tail slots since the probability that two signatures share the same key value increases when substring length is smaller.

the total memory consumption increased and the load factor decreased when k = 2 in Figure 4.


As this paper focuses on the impact of integrity attacks on RTP systems, we ignore the small variations in the locational prices.

we assume that all the suppliers and consumers are subject to the same real-time price .k.


Free Trial Accounts: We did not have any speci.c funding for opening and maintaining accounts with SaaS-CPs for this study.

we were limited to analyze only those SaaS-CPs which offer a free trial account for their services.


We believe this is an appropriate assumption because kernel developers are largely well-meaning, and do not try to access unnecessary interfaces on purpose.

by capturing the intended privileges of a module, and by looking at the interfaces required in the source code, we can prevent an adversary from accessing any additional interfaces at runtime.


SIZE REDUCTIONS RELATED TO KEY MANAGEMENT Public-key structures consume a lot of space, and in a default implementation they do take up the bulk of the MTM state.

optimizations to these structures are required to make the state vector more suitable for e.g.


On the other hand, it is much less likely that a coalition of high scoring players would explain every variation in every pirate movie due to chance alone.

if we observe a coalition that explains the attack, and if the probability that such a coalition would exist due to chance alone is low enough, we conclude that it is unlikely that the coalition comprises all innocent players.


4.2 Translation Engine Translation engine cannot handle hardware diversities, such as X86 processor and AMD processor, or rtl8139 NIC and e1000 NIC.

we pre-con.gure QEMU and Xen device emulation module to emulate the same type of devices for Guest OS, such as X86 processor, rtl8139 NIC and etc.


In order to derive reliable and uniform data from (imperfect) sources of randomness, such as a PUF, the concept of a fuzzy extractor [8] or helper data algorithm [28] was introduced.

we obtain a master secret from the fuzzy extractor.


Moreover, the circuit model of evaluation results in a very di.erent, and rather less intuitive, order of execution than a RAM implementation.

we had to provide ourselves with several compiler capabilities to help with development.


The time it takes to start a session can negatively impact a user s experience especially if the delay is noticeable.

we aim to quantify the effect of the SDP on session initiation and destruction.


4.1 Optimal Strategy for the User The adversary observes the pseudolocation r ' output by the LPPM, he knows the function f(r ' |r) implemented by the LPPM, and he also knows the user s pro.le .(.).

he can form the posterior distribution ' Pr(r, r ' ) f(r ' |r).


Considering the response feature, at the effective point, the frequency response is calculated with interference of noise brought by the environment, while at the point in the gap between effective points, the response is meaningless because only noise exists.

only effective points are counted when producing the feature.


It also verifies that the subject profile of the requesting secretary satisfies the credential expression ( /Secretary ).

it returns all the employee nodes of the organization.xml document that are children of all the department elements apart from those having the Dept attribute equal to Marketing or R&D .


After that, we count the #CVCs by considering the di.erentials of CVs, rather than the DV.

(Details are explained in Section 6-III) when we count the #CVCs, we know whether di.erentials are in MSB or not, and thus, our counting method covers all cases of addition in MSB.


We chose to look at the data from a single application because it increases the di.culty of our task if we believe that users have di.erent mouse behavior for di.erent applications.

the goal of our experiments is to determine whether a user x when running an application M (e.g., Internet Explorer) can be distinguished from the other n-1 users running the same application.


Also, Alice s computation can start as soon as ets is received.

alice requires only a negligible amount of local storage.


Indeed, the role-to-role assignment has two meanings: if R2 is activated, R4 should be activated (moving from the set of deactivated roles to the set of activated roles); if R2 is deactivated, R4 should be deactivated as well.

we need two policies for these two cases.


The secrecy is more relative to how many people are attending the event and how many people are in tune with the user s schedule, giving these questions varying degrees of secrecy.

while these questions might not be as secure, they are easier for the user to remember due to their being drawn from actual events the user is already consciously trying to remember.


Similarly, the WRITE SETTINGS permission allows an app to update many distinct phone settings, including the default ringtone and network preferences.

for these permissions, we can introduce .ne-grained variants that separately grant access to each state or setting of interest.


This approach is less than ideal, for many reasons that we discuss in this paper, including scienti.c validity, ethical and legal issues.

we present an alternative approach employing in the lab experiments involving at-scale emulated botnets.


The rewritten code invokes the rewriting function RW on the string, and the URL adserver.com yielding the string tmp10 = box("evil.com", "adserver.com"), if (tmp10.url != "a.com"){ tmp10.taint += ["untrusted"] }, initSettings(tmp10); The if-expression injects the taints to the value returned by the implicit getter-call (i.e., the read of tmp10) that yields the value passed to initSettings.

the argument passed to initSettings carries the taint untrusted , which .ows into searchUrl when the assignment inside initSettings is executed.


As a result, the revenues of a firm depend directly on several complex software-based systems.

stakeholders and users should be able to trust these systems to provide data and elaborations with a degree of confidentiality, integrity, and availability compatible with their needs.


In addition, the information is only accessible by the users of the associated VSD and not by any party belonging to a di.erent VSD.

the user is not vulnerable to the single point of failure as his/her details are distributed but still the information is secure among the members of the domain.


Note that in the unconstrained case, it takes signi.cantly more time to construct an attack vector than the previous experiments.

we show more detailed results on execution time in this case.


In its essence, such hybrid caching strategies can be implemented by using a PAC as proxy which transparently forwards all static requests to the underlying cache optimized for static security policies.

hybrid caching can be understood as variant of a multi-leveled caching approach using SC or SAAM as .rst-level cache and PAC as second-level cache (see Fig.


SHIFT is implemented by adding aphasebetweenthephases pass leaf regs and pass sched2 intheGCCback-end.Inthisphase, allregisters have been allocated and the instructions are not scheduled yet.

the implementation of SHIFT can avoid interference with the register allocation algorithm and the code scheduling algorithm for Itanium, which are two of the most complicatedphasesinGCC.


Ideally, the task of de.ning security aspects is done at the work.ow model itself.

both business process and technical security experts may collaborate on a security augmented work.ow.


Another difference is that we must implement the client process that reads the symbol table of the monitored kernel in its own guest operating system, since it still requires a full operating system environment to function.

we enhance the kernel supporting the client process to pass the symbol information from the process down into the Xen VMM by adding a new Xen hypercall.


Whenever the mobile node meets a partition symbol, it moves to the data items pointed to by the next Pid in the pointers list.

the mobile node does not scan all the data items of the OIRi report but only the ones belonging to the groups of interest.


This experience is split into two parts: QoE contributing to the positive experience and (1-QoE) to the negative experience.

beta reputation f(p|a, ß) gives the PDF of the probability of having a complete satisfactory experience, i.e., the expected QoE.


At each step, the algorithm makes only one recursive call and m operations.

pd(x1,...,xm) can be computed in time O(dm).


In the .eld of disk benchmarking, Ganger [6] observed that interleaved workloads provided the most accurate approximation of recorded traces.

mechanisms for representing access control workloads must be capable of simulating the interleaved actions of multiple actors.


The results indicate that we only had one-sided errors: an execution path accepted by the attack NFA correlated with a non-conformant padding with 100% accuracy.

the best strategy for the adversary is to send k requests to the padding oracle for each padding, and stop once an execution is accepted by the attack NFA and consider it to be non-conformant padding.


The attacker can authenticate itself to the server S but can not compute the agreed session key H (IDi | H (x) | H (ni) | EIDi | T) between the user Ui and the server S because the attacker does not know the values of IDi, H (x) and H (ni).

the proposed protocol is secure against man-in-the-middle attack.


However, we might have di.erent levels of trust for di.erent users or we might want to make some of the users more important than the others.

in such a situation, one way of handling this is to give a larger number of shares to the users we trust more: if we give x shares to the trusted users, then we give y shares to the others, where x>y.the scheme becomes a (ax + by, k)-ThSS, where a is the number of users that we trust more and b is the number of regular users.


We consider an individual who wants to share his genome, yet who is concerned about the subsequent privacy risks for himself and his family.

we design a system that maximizes the disclosure utility but does not exceed a certain level of privacy loss within a family, considering (i) kin genomic privacy, (ii) personal privacy preferences (of the family members), (iii) privacy sensitivities of the SNPs, (iv) correlations between SNPs, and (v) the research utility of the SNPs.


Dynamic kernel objects allocated by the same code correspond to the data instances of the speci.c data type used in the allocation code.

we aggregate the access patterns of dynamic kernel objects that share the allocation code.


The solution to this problem is through our design of policies which allows the addition of context information.

the printer agent can add a new policy as shown in Figure 5.


Empirical supply model: Quadratic cost functions have been widely adopted in the analyses of power generation systems [15], i.e., ci(x) = aix 2 + ßix + di, where ai > 0.

to make ci(x) non-negative over x = 0, we have a few addi ß2 if .k = ßi, si(.k) (.k - ßi); otherwise, tional conditions: di = 0 if ßi = 0, or di = i 4ai if ßi < 0.


It can do the same also with the messages that the controlled peer receives.

the RN relations cannot be used for active adversaries.


These tools evaluate code based on strict conformance to the language speci.cation, and consequently generate a large amount of false positives.

the generated reports are often overlooked by developers who struggle to spot which of the reported bugs are actual errors.


By replacing h with |1-Ew|· h in Proposition 2, we have a new result in the presence of the estimation error Ew.

from the proofs of Propositions 3, 4, and 5, they are independent of h. these propositions still hold in the presence of estimation errors.


As the resulting log is non-empty, the authorization term assert (isEmpty getlog) will throw an exception.

for the authorized term, rule (AURET2) is the only applicable one, so that term evaluates to throw UnauthorizedError.


Additionally, attackers that try to blacklist benign network nodes by sending faked MRs without having an overlap scenario on the road, have to be considered.

the following considerations are checked before starting the evaluation of a session: a) Either MRs from all overlapping nodes are received or the number of needed witness reports must be increased with respect to an upper bound.


In each case, our static analysis determines that the programs contain no such vulnerability.


Therefore, SME constraints do not only a.ect runtime task execution, they already a.ect the task-to-role and role-to-subject assignment relations at design-time (see, e.g., [21, 25, 27, 32]).

if we want to de.ne that certain subjects or members of a certain role are allowed to perform two SME tasks in exceptional (emergency) situations, we must explicitly de.ne a corresponding break-glass override via the bbr or bbs mappings (see De.nition 2).


It is noteworthy that the automated conversion algorithm in Sechduler results in an automaton with provably minimum number of states ensuring that the performance overhead of the runtime monitoring and veri.cation is minimized.

using a realtime and security-aware scheduling algorithm through continuous optimization for timely resource allocations and discrete logicbased monitoring for security veri.cations, Sechduler makes sure to provide both realtimeness and security guarantees simultaneously if feasible depending on the available time and resources.


The .rst set of trivial constraints that the optimization problem has to respect is that the known queries has to be assigned to their known values.


Second, we wish to capture bi-directional associations (i.e., the blacklisting of one address must not strictly precede/follow another).

our work falls into thebroaderdomain of temporal association learning.


UKeygen1 selects a random skU .Z * q and outputs pkU = e(g1,g2)skU .In the Show1 protocol, the double-spending tag is calculated as E = g1 skU ·F(g1,s)(c(1,T,J))R.Consequently the value sU , returned by Identify1,is g1 skU which is secret information!

the VerifyViolator algorithm is de.ned as follows: VerifyViolator (pkI,pkU ,sU ) accepts only if e(sU ,g2)= skU skU e(g1 ,g2)= pkU .Intuitively, because g1 is secret information, its release signals that this user misbehaved.


There are O(k2/o) rounds of communication in the .rst phase of p, and each player sends a single bit in each of these rounds.

p uses O(k3/o) additional communication over p ' .


However, such effort is not very e.ective because ToR s throughput is low and ToR IP addresses are public.

it is very easy for service providers to pay special attention to the requests coming from ToR IPs.


Most user mode applications as well as kernel mode ones, rely on the basic system calls to communicate with .le system, networking, process information, and other functionalities.

taking control of the system call table enables one to control the entire kernel from the bottom.


This means that the partial register and the byte addressed by the r/m8 operand must yield a value of zero when the and operation is executed.

the partial registers used arechosensuchthatazero byte is createdat r/m8.


Step 6 N 3 N NO log242 2 ) conj g(xy * (x, y) , 2 involves computation of inverse wavelet transform, which is also a O(N ) function.

the computation complexity of entire encryption phase is computed as follows: 23 2 .


The result of this process is that the distributions of policies for a given possession sensitive attribute are identical for users who have the attribute and users who do not.

an opponent cannot infer whether or not users possess the attribute by looking at their policies.


CurrentBestOffer: used by the host H to inform all the auction participants about the current best offer.

the Transaction Set (TS), of the originator O includes m transactions that look like: {t1=[(suggestOffer, Offer1), Sig1] tk = [(sendWinningTo, Address), sigk] tm = [(suggestOffer, Offerm), Sigm]}  By then the (k, n) secret sharing is used to produce the following set of shares: {{t9 t1n}, {tm1 tmn}}.


To keep the TCB small, the default SLB Core includes no support for heaps, memory management, or virtual memory.

it is up to the PAL developer to include the functionality necessary for her particular application.


With a smaller number of relaying nodes, our scheme makes a report successfully reach the base station.

the average communication cost of our forwarding scheme for delivery of a single packet is smaller than those of the previous schemes.


To enhance the intra-and inter-block optimizations, we introduce the concept of Linear Lower bound, which interprets memory operands as a series of linear equations: br eg + s × ir eg + d (2) Memory addressing in x86 architectures can be expressed as a linear equation (2).

it contains two variables for base and index registers (br eg and ir eg ), a coef.cient s for scale, and a constant d for displacement.2 we can say each BBL is associated with a group of linear equations, where each equation represents a distinct memory operand (Fig.


The malicious attacker cannot modify the monitoring measurements; it can only trigger the monitoring de  vice to sample at an incorrect time period using GPS spoo.ng.

the time stamps attached to those measurements are incorrect.


In passphrase conditions that did not permit reordering, we found that 9.3% of passphrase entry errors were due to entering words in the wrong order.

it appears that relaxing the order requirement may provide small usability gains, but these gains were not signi.cant in our study.


Such a centralized method for global software distribution is not acceptable as it would severely hamper small software developers, as well as opensource software that is distributed by source code and compiled individually by users.

we believe the applicability of this approach is limited primarily to environments where a single entity is responsible for determining what software can be installed on all machines, such as organizations with centralized IT management, or to environments allowing automatic software updates from trusted entities to be applied to machines for individual users.


In the .rst case, the shellcode must update the SEH list head pointer at FS:[0], while in the second case, it has to access the current SEH frame in order to modify its Handler .eld, which is only possible by reading the pointer at FS:[0].

the .rst condition of the SEH-based memory scanning detection heuristic (SEH) is (S1): (i) the linear address of FS:[0]is read or written, and (ii) the current or any previous instruction involved the FSregister.


The malware analyzer must be at a higher privilege level than the maximal privilege level a malcode can escalate.

all the exception handler and virtual memory mapping routines reside at a higher privilege level.


Prior studies have employed kernel traces for reverse engineering, anomaly detection, operating system noise evaluation, software defects, post-mortem forensics, multiprocessor scheduling behaviour analysis, etc.

kernel traces should be considered as one of the potential evidence sources used in forensic readiness.


If a successful evaluation is impossible using cached material, the algorithm is re-run from scratch with no caching.

we do not cache negative results: a caller will never be denied access if the ACL allows it.


For example, if the allocated version of the contacts2.db .le included the number 212-555-0123, we considered any .eld from any page containing this number as relevant.

relevant .elds are not limited to the pages in contacts or SMS databases.


Our tool also parses the input according to the knowngrammar,andsodetermineswhichprotocol.eld contains eachinputbyte.

one simple wayof matching variables with one or more input .elds is to combine these two mappings.


These credentials are often issued by trusted third parties based on requester s quali.cations and characteristics.

when compared to the traditional authentication systems, access decisions based on such trust veri.cation methods o.er scalability, .exibility and extendibility.


Therefore, the probability that no key is shared between the two rings is the ratio of the number of rings without a match by the total number of rings.

the probability that there is at least a shared key between two key rings is: k!


Recent work has indicated that signature-based detectors might recognize a particular instance of such an attack, but are unable to generalize to the class of buffer or heap overflow attacks.

given a generic overflow attack, it is comparatively easy to build different variants of the same attack, either by hand [5], [6] or automatically with suitable a priori information [7].


The proposed methods still have the advantages of REA method, while overcome the drawback.

frequency estimation performance can be improved by using the proposed methods.


Note however that the Text participants use of mnemonics inherently leads to insecure passwords, while PassPoints image cue does not.

we believe that if a similar cueing mechanism could somehow be added to text password systems, their security could be improved without sacri.cing memorability.


Also, the initial set-up of the biometric authentication system is performed by the entity who owns the biometric database D. All these issues are irrelevant to the security of the O-PPBA protocol.


In fact, we can de.ne constraints that are not separation of duty constraints in the traditional sense.

we will use the term authorization constraint [4].


A notational convention: It is easy to prove that commands preserve the values of Hfand (f, f-1).

we can, without ambiguity, write S ' rH,(f, f-1 .


Using these approaches, the same packet appears di.erent on each packet forwarding hop.

an eavesdropper cannot identify the same packet transmitted on every packet forwarding hop.


Importantly, the malicious JavaScript interception cannot access the URL to which the user intended to navigate: a call to window.location yields the current URL, not the new one.

a malicious web site can prevent a user from navigating to another site, but it cannot determine to which site the user meant to navigate: the BeamAuth token remains safe.


Enforcing Corporate Security Policies via Computational Intelligence Techniques Antonio M. Mora, Paloma De las Cuevas, Juan Julián Merelo University of Granada Department of Computer Architecture and Technology, ETSIIT/CITIC Granada, Spain {amorag,paloma,jmerelo}@geneura.ugr.es ABSTRACT This paper presents an approach, based in a project in development, which combines Data Mining, Machine Learning and Computational Intelligence techniques, in order to create a user-centric and adaptable corporate security system.

the system, named MUSES, will be able to analyse the user s behaviour (modelled as events) when interacting with the company s server, accessing to corporate assets, for instance.


The node-set returned by evaluating a query on the query tem plate could be a superset of the nodes the user is entitled to see, according to the Owner access control policies.

in order to verify the completeness, the client must also consider the access control policies speci.ed on the document.


We always assume the radio range is R = 40m.

there are p×40×40 50.27 sensor nodes on average in the 100 Memory usage Figure 4: Probability of having a direct key between two neighbor sensor nodes.


The tree-based schemes use C= {{i2j,... ,(i+1)2j -1}for all j=0,i>0}.

7 tree constructing a-te schemes is reduced to a combinatorial problem of constructing a-separating collections; the number of intervals containing t,for each t, corresponds to the scheme s cost.


To compute the challenges and responses the following publicly known algorithms, that we depict in calligraphic style, are used: T is the algorithm used to generate a threshold to which the vector items are compared (in particular a deterministic PRNG which receives random r as a seed can be used), E is the key extraction algorithm which extracts each key bit by comparing the values obtained from the accelerometer to the corresponding value from the thresholds and E"1 is the inverse of the extraction algorithm which tries to recover the key.

the thresholds are extracted from the committed random values, i.e., t T (r), then the key is extracted, i.e., k E(v, t) and .nally the challenge is computed, i.e., c = Ek (N).


ReKeyGen(ski, pkj ): This algorithm generates the re-encryption R key by selecting s, t, w .

zq and setting rki.j =(rk1, rk2, rk3, rk4 , rk5 , rk6 )as -ski H4 (s·ski ) H4 (s·ski ) t t w (H0(pki)· pk,g g1,g,g, j )tw e(pkj , pkj ,e(pkj ,g)tw) Note that rk5 cannot be altered due to unknown t and w. the re-encryption key rk cannot be manipulated (Manipulating rk5 , rk6 will be detected in Dec when decrypting .rst level ciphertexts.)


neither tends to be believed to reach trusted nor tends to be believed to reach untrusted.

we have Definition 7 : The extensive formula of authentication trustworthiness factor expresses the authentication trustworthiness factor under the condition that the trustworthiness of authentication mechanism is T(m).


Our study also finds that the YASS embedding not only increases the zero coefficients of the host blocks, but it also modifies the neighboring joint density of the DCT coefficients.

we design a new algorithm to improve the detection performance.


The key assumption is that shutdowns (1) involve a signi.cant percentage of services and (2) take a relatively short time, i.e., W < W , to complete.

we detect a shutdown whenever the shutdown condition d µ = d¯, is met, where d¯.


In the following, we will further concentrate on improving one-wayness and disclosureresilience properties.

we propose alternative approaches for drawing functions from OPFD,R in order to lower the probability of successfully guessing a plaintext (or a set of plaintexts) whose encryption creates (respectively contains) a given ciphertext.


N ,RP Our approach to formulating the de.nition of a policy is independent of the language in which access control policies are expressed.

our approachcanbe appliedtolanguages other thanXACML.


A well written bot does not need to disrupt normal operations, and the user has little damage from sending SPAM.

there are few reasons for an individual user to spend money to protect his computer from being infected by a spam bot.


To resolve the hidden access paths from the policy rule base, GPref , the above formulas need to be represented in terms of deny (or blocked service access) rules.

the causing rules under each con.icting hidden access path need to be blocked (set as deny ).


Thus, we want to collect data with simple VMI techniques from VMs bypassing the complex cloud framework, but we also want to keep the con.dentiality of any sensitive information obtained during this process.

a VMI system in the cloud, which is able to respond to queries from multiple users or security monitoring systems with simple and standardized results would be bene.cial.


However, a particular attacker may choose to respond to some captchas and not others, depending on the con.dence in their guess, as web services usually limit the number of attempts per IP [2].

a more precise way to evaluate attack effectiveness is through coverage and precision metrics.


First, native code is currently not supported by AppIntent.

privacy leakages in native code cannot be captured.


We wanted to collect the actual privacy decisions people had made.

we designed a user study to gather this data from a collection of iPhone users.


As these key inputs arc not accessible by the attacker, one cannot force the values necessary to propagate the effect of a key.


In addition to the burglary itself, insurance companies might refuse to pay the damage, given that the information was readily available from the inhabitants own system.

unsecured HASs can also be a monetary danger.


Every time an agent moves along an edge, the weight of the edge increments.

with every agent using the same edge, the edge becomes less likely to be used.


Every shared resource retains its identity, its originating SCS as well as ownership.

other auxiliary information regarding a shared resource that is needed for protection will also be retained after sharing we can uniquely identify a shared resource across all SCSs in the confederation.


Finally, we can solve Max Weighted Partition in Op(2k n 2) time.

the total time required to solve WSP(=, O(2k(c+n 2)).


Any state machine that reaches the DONEstate is deleted from the list.

when monitoring protocol behavior, we create many instances of the state machine, each of which traces a path in the EFSA from the INITto the DONEstate.


There are currently over one billion OpenID-enabled keys provided by major CSPs [34], and they are too valuable to be ignored.

the solution should be backward-compatible with existing IdPs and RPs and support gradual adoption.


The source operand of the second instruction references the .rst byte in the msg array that has symbolic value b0 .

eax gets symbolic value (movsx b0 ) after the instruction is executed.


Finally, as mentioned previously, any execution of a HLT instruction will result in complete termination of all Native Client threads.

no thread may ever attempt to execute NaCl code memory while it is being updated: doing so may cause // For an instruction pair OLDI and NEWI , // with both instructions of size N-1 bytes.


The controls and their weights would be di.erent in the context of the data disclosure threat (a.ecting the con.dentiality).

highly e.ective data backup policies which are requiring the organization to backup their data to a remote location are the most e.cient solution to avoid data loss.


Chains of length less than this were discarded.

post-processing yields re.ned HMM outputs over the label set {S,M,*}.


PERFORMANCEEVALUATION The adaptive thresholding algorithm proposed in the last section is generic because it does not rely on the detection features andprinciples of the underlyingIDSs.

in this section we incorporate the adaptive thresholding module into the six ADSs evaluated in this work and evaluate the accuracies and complexities of these adaptive ADSs.


This model is conceptually at odds with a device such as Kells, which independently enforces security policy.

we reconsider how the device interacts with the host.


The leading byte of any words that contain a stack address corresponds to a non-printable ASCII character.

packets exchanged via text-based protocols can never contain bytes that correspond to stack addresses.


The application itself does not have access rights for the resource, but via the reference, the application can access it.

the user transparently provides the necessary access rights the application needs.


The VMM policy governs the .ows between VMs using the abstractions provided by the VMM.

a VMM policy labels VMs and other VMM resources and describes the access rights of VM labels to VMM resource labels.


We recall that the last AES round does not include Mix-Columns transformation.

a byte xa at the input of the last S-box layer can be viewed as an XOR of the .xed mask na with the known function of a last round key byte kR,ß and a corresponding ciphertext byte cß, xa = na .S-1 (kR,ß .cß).


Our detection techniques are independent of the method used to decide if a device is infected or not.

their e.cacy will be improved when they are used together with better techniques for identifying malware.


Of course, neither the .rst nor the second model are good for description of the behaviour of attacker, since an attacker always has some knowledge about the system, but this knowledge is not complete.

new and more realistic models of an attacker are required.


However, it is possible to obtain similar amortization for -OT G)k n by using ef.cient reductions from this primitive to -PIR (e.g., k using [15, 24, 25, 19, 11]).

the application of batch codes G) n carries over to the -OT primitive as well.


As a result, this technique has been subjected to various forms of attacks.

to mitigate those attacks, password authentication has gone through several enhancements and modifications.


However, in practice the spoo.ng attack could present at any time.

the pro.les built under such attacks cannot represent legitimate users and may lead to authenticate malicious users falsely.


In our datasets, a user is directly assigned to the same number of roles across each of the Stanford, Hybrid and Core policies.

there is more heterogeneity in the roles that a user may activate in the Stanford policy than in the other two.


In the Kolmogorov-Smirnov test, we measure the distance between the test sample and the training set that represents legitimate behavior.

if the test score is small, it implies that the sample is close to the normal behavior.


If a delegated endpoint crosses a channel, the owning principal is instead set to a principal identifier that corresponds to the compound identity previousOwner + newOwner.


For example, malicious users can obtain the mapping and use it to launch DoS attacks, or may frequently query a speci.c user to track his/her behavior.

enforcing access control at the query would be a powerful tool as it can provide the mapping owner the ability of choosing who it is willing to communicate with.


This is possible in the following scenario: When AS and C exchange KAS, A could replace KAS with his own key KA.

c encrypts pms with KA, which can then be decrypted by A.


In this paper we present a security type system that enables mixing protocol primitives in a generic programming language, but also ensures that well-typed programs are secure in the semi-honest model.


The replayer facilitates any existing malware analysis platforms that are based on dynamic binary translation.

the existing analysis plugins on these analysis platforms can continue to work with minimum changes.


The connection is relayed to virtual machine images running the application appropriate to the connection request.

new and important threats are handed off and actually executed so the resulting activity can be monitored for new worm behavior.


Starting DMA usually requires PIO or MMIO access to a device register.

the hypervisor can easily capture the event.


It consists of three functions, G', S',and V': 1) a randomized key generation algorithm G' takes as input a security parameter (e.g., the desired length of the output) and a set of elements, A, and generates a public/private key pair (pk',sk'); 2) a signing algorithm S' that takes rithm.

the cost of one public key signature veri.cation can be amortized over the cost of many set-membership veri.cations.


Even if the past session key is disclosed, the attacker cannot derive the above values because of security of one way hash functions.


Moreover, suppose that u is interested only in those nodes tg3 whose attribute Att is equal to IT .

according to the view in Figure 9We postpone the details of the query template generation in the next section, where we will explain the role played by this document in the completeness veri.cation.


First, there is a need for a large-scale evaluation.

we draw no .nal conclusions and, concretely, do not extrapolate a threshold value for the RMSE from our data that allows decisive distinction.


Our proposed architecture allows running conventional applications without engaging the MVEE (see Figure 1).

normal applications may run conventionally on the system and in parallel with security sensitive applications which are executed on top of the MVEE.


fnum f den (X, Y ) < t · (X, Y ), where 0 < t < 1 is a threshold.


Also, we have used SAT to show that for each AND gate, there is at least one input vector that could activate the malicious circuitry.

our results indicate that the attacker can use the rare activation condition to trigger the malicious circuitry during the system operation, while the single HT gate with low switching probability is di.cult to detect when the malicious circuitry is dormant.


This ambiguity will create enough confusion that the attacker will not be able to track any one user over time.

dataisavailabletotheuserinrealtime and without interruption.


While deriving exact numbers is hard, it is commonly assumed that the accumulated economic damage from software copyright infringement ranges in the order of several tens of billions of dollars [15, 22].

software manufacturers regularly integrate technical protection mechanisms in their products that aim at preventing unauthorized copying and redistribution.


Bary and Tary table updates cannot be interleaved; otherwise, at some intermediate state in an update transaction, some IDs in the Tary and Bary tables would have the old version and some IDs would have the new version.

check transactions would use different versions of CFGs for different indirect branches.


Although PTP places randomly-selected characters into users passwords, users may shu.e to obtain new characters.

a user with an all lowercase password may shu.e until the system randomly selects only lowercase letters.


To revoke a permission, the following command should be substituted for the Revoke statement in the algorithm: setfacl -d u:username:---filename The changes to the algorithm discussed above to add Unix groups are not even necessary as the algorithm in Figure 4 will give the appropriate permissions to users assigned to the roles.

the only change to the algorithm is to replace the Grant instructions with setfacl -m commands and replace the Revoke instructions with setfacl -d commands.


[10] measured that when .mem =0.2, the memory latency only increases by about 6% compared to the memory latency while .mem = 0.


While traveling, the user can be served by di.erent context (networks, systems, resources), which require authentication services periodically.

proactive support system must know when to perform the authentication so implicitly explicitly, seeking to reduce the user interference.


Although nonvolatile RAM (NVRAM) for general storage is rapidly growing cheaper today, securing large quantities of non-volatile RAM is still not easy to do.

secure and low-cost hardware components such as the TPM are currently limited to having only small amounts of NVRAM.


5.2 Testing Methodology We had no access to the implementation code of the cloudbased SSO products.


Randomization is done by the dynamic loader just before the control is passed over to the application for execution.

every execution of the program results in a di.erent process memory image.


It can 2(j+1)(2j+1)(1+x)j be easily proved that when b and j are .xed, EY (Y)is a monotonically increasing function of x.

when a is smaller, the expected waiting time will be shorter.


, then mainly due to the RoK scheme [3], we do not go into its detail in Both forward and backward key rings are stored in the memory of a sensor node before the deployment.

total of ..... .. keys are stored in each sensor node.


The definition of personal data and the understanding of which kind of data can be classified as personal data is fundamental to the regulations governed by these directives.

defining personal data, how it may be collected and processed leads to the understanding of what is meant by privacy.


Speci.cally, we generate a role-permission assignment RPA * from the permission sets of the roles.

a new RBAC con.guration c * = .U, P, R * , URA * , RPA * .


To emulate the real-world usage scenarios, we login into the hosts and perform tasks including browsing the malicious website and ftp server in the local network and downloading samples, sending and receiving adverse instant messages and emails, accessing P2P shared folders or removable drives that contain samples, etc.

the samples are introduced into a host through various channels.


However, our exposition in the paper focuses on this case since that parameter choice resulted in the best error rates.

the following subsections will at times use slightly di.erent parameter choices than we ended up with.


Once running the key update protocol, c is increased by 1, so the building block cannot compute the previous symmetric key k as c has been changed, thus the secure OS cannot be decrypted.

only the new deployed software can boot the system, which prevents downgrading attacks.


When we chose a stateless framework for the Web, the ability to preserve those features was lost.

by choosing statelessness, we have chosen a TCB that is weaker than a stateful TCB.


In the 150 million alerts we observed in our ISP dataset logs from 40 IDS, only 4% are caused by epidemic worms.

iP blacklisting continues to be an important tool for warding o. attack.


To prevent forgeries, a new message must involve a new exponent, either e1 or e2, which never occurred in the signatures provided by the signing oracle.

a .rst requirement is that µ1 and µ2 de.ne at most one message m, but only if they have been correctly constructed.


This isbecause, the trusted computingbase(TCB) for commodity virtualizedinfrastructures, which includes both the VirtualMachineMonitor(VMM)andthe managementVM,isinthe scale of several millions LOCs.

the stack is prone to intrusions and jail-breaks .


However, these are problems of web applications in general and not speci.cally CI systems.

this class of problems will not be analyzed more deeply in this paper.


Furthermore, a recent study performed by the UK s O.ce of Communications [49] coined the term media stacking, which refers to the fact that about half of UK s adults conduct their smartphone or tablet computer while watching TV.

our assumption seems to be reasonable and the outlined attack scenario is rather realistic.


The rules generated by all non-evolutionary rule learning algorithms are not only simpler to comprehend but are also smaller in number.

the comprehensibility of the rules generated by RIPPER, SLIPPER, PART and C4.5 rules can be categorized as High.


Users and attackers are assumed to respond to both the VALUE of the system and to the level of SECURITY.

we understand the state of the system to consist of two vectors: internal and external.


50% of the training instances of C have scores larger than or equal to base score [7].

we can obtain the normalized aggregate score of s in each class C by the following formula: scoref(s,C)=score(s,C)/basescore(C)) 3) Making decision After obtaining the normalized aggregate score of s in each class C, we can assign to s the class label C, for which the normalized aggregate score is the largest.


PROPOSED SOLUTION We proposed a new method based on Greedy Geographic Routing Protocol, and the deploying of RSUs for low-density network.

when the vehicular node cannot find any neighbor due to the mobility of the cars, it will forward the massage to the nearest RSU in order to avoid the dis-connectivity of the VANET.


Depending on the sizes of the devices, the user cannot hold too many of them at once.

the method is not feasible for situations of forming a large-scale network of numerous devices; for instance, a group of gamers cannot shake their gaming devices to form an ad hoc network.


This decreases the size of the possible password space.

we are currently working on a web based version of PassShapes which will be used to investigate this kind of user behavior including the question What kind of PassShapes will users choose?


Therefore, the size can be compressed by using the pairs of LBA and the sector count.

the number of entries for .le data regions becomes only 2.318.


RELATED WORK Our work encompasses purely theoretical concepts such as in [22] and focuses on the realisation of these models in the smart-phone OS Android.

this section focuses on related work which deploy practical implementations.


The Galaxy S3 stock .rmware already contains this smart card API for the built-in secure element, however, it is not enabled for the Mobile Security card.

we had to replace the .rmware of the phone with a custom build of CyanogenMod9 [20] based on Android 4.0.3 where we in cluded the smart card API patches (version 2.3.2).


The complexity of model checking a propositional CTL*lp formula with respect to a model is in EX-PSPACE [39] in the formula length.

for a pLTL policy we can check whether the policy has the .-property in exponential space in the policy size.


Moreover, because a program s functionality is mostly determined by the library or system calls it invokes, its function-call graph provides a reasonable approximation to the program s run-time behavior.

the function-call graphs of the malware variants that are derived from the same source or binary code are often similar to one another.


This observation also validates that criminal accounts have stronger social relationships and semantic coordinations among themselves.

it will be more e.ective to use known criminal accounts other than normal accounts as seeds to infer other criminal ones.


Due to Snort s large user base, it enjoys a comprehensive and up-to-date set of signatures.

although for .exibility we have designed a custom signature language for Bro, we make use of the Snort libraries via a conversion program.


Smart cards axe used in many applications that require a tamper resistant area.

smart cards that use cryptography have to provide encryption, deoryption, as well as key generation inside its security perimeter.


As shown, there are eight nodes in the network (i is external) with limited accessibility as shown by the edges.

for attackers to compromise a Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


For mobile devices, one often downloads and uses many applications (or apps) with limited functionality from multiple unknown vendors.

the defense against malware must depend to a large degree on decisions made by the users.


The comparison of two composite values is made by comparing the sub-attribute values separately.

we de.ne a bitmap to store the comparison between the source and destination IPs.


To address resourceexhaustion attacks (for tracking of nonces, tokens, and verifiers for pending transactions), the OAuth server requires transactions to complete within a short period (15 minutes) and rejects requests with timestamps outside that time period.

oAuth clients must maintain accurate system clocks to include accurate timestamps in OAuth requests.


For example, when a TV station adds some authentication information to its signals for cognitive radio receivers, if all the existing television sets (which are not cognitive radios) need to be recalled and modi.ed, no TV station will add the authentication information.

it is essential for the authentication scheme at the physical layer to be transparent to the existing devices.


To allow the speci.cation of obligatees, we extend the policy rules to include an extra .eld called obligatee .

policies now have the following form: p = o).cond(u, .


The audit process can gather this data in a number of ways: from observing security-related behaviour, from analysis of various audit trails as well as through the interviewing of sta..

studying the organisation from a subcultural perspective will yield a set of norms held by management, subcultures, as well as individuals.


The difference in a festival is that there are artworks from several artists.

several groups and respective managers may be defined in order to support all diverse kinds of artworks.


We also sometimes use the notation catS to denote cati1 , .,..., ., catig .

in our basic scheme we need the following four algorithms: The key generation algorithm PCEKeyGen(1k) .


Instead, our approach characterizes the application behavior, not the individual user behavior.

our approach is naturally scalable for handling a large population of users.


It is clear that solving this equation for b means guessing it, which is at least as difficult as guessing a itself.

breaking the security of blinded-key signatures is, for the agency alone, at least as difficult as breaking the underlying cryptosystem by guessing a private key.


If the quadruple is a Di.e-Hellman quadruple then we passed the adversary input from Experiment1, otherwise we passed an input drawn from Experiment2.

if we can simulate the decryption oracle we can distinguish Di.e-Hellman quadruples, which is assumed to be hard.


Nevertheless, the same information format for describing computer events can be utilized.

existing standards such as CEE and IODEF can be adapted to cloud security with proper semantics review.


So, when the aim is to make the watermark as robust as possible, this will affects, negatively, the invisibility issue.

high care must be kept to ensure that the information added by the watermark not to reach some maximum limit.


Conversely, if transferring the encrypted genome is part of the online phase, transfer dominates complexity of SPH-PSM.

the preferredinstantiation is EC-ElGamal, since group elements are much smaller (160-bit), as opposed to 1024-bit in AH-ElGamal and 2048-bit in Paillier, using the same security parameters.


In this part of experiments, we did not generalize variations of hyper-alert types.

these graphs still have syntactic differences despite their common strategy.


The reason is that using the same interface identi.er all the time allows a third party to link all tra.c to the same device and possibly to the user, even though the user changes location.

privacy extensions to the stateless address autocon.guration protocol have been proposed [10] and implemented.


At runtime, when the system control comes to a speci.c NCKM, Barrier dynamically .ll the mappings for the memory pages occupied by this module: its text pages are marked executable and readable, while its data pages are marked readable and writable.

once this module gains the CPU, it can only access its own code or data.


It takes two seconds to measure the list file while booting, as shown in Type C. In our proposal, the hash value is calculated for each read block, and is compared with the value recorded in the list.

starting up of Type C takes longer in starting up than Type A and B.


For example, our tests indicate that it takes approximately 4.436 seconds per database object image to perform a PWD based attack against a single problem on an Intel Core 2 Duo E6850 machine.

if an object database of size 1000 were utilized then the task would take approximately 73.93 minutes to complete.


= It is also trivial to verify that CC(p ' )= CC(p)+k.

it remains to show that succ(p ' )= succ(p).


INTRODUCTION The semantic meaning of audio can be easily altered by audio editing and processing tools.

audio authentication has become an emerging technique in recent years, aiming at effectively protect the originality and integrity of audio signals.


For =Xi N (a, d2), it is well-known that rms(f ) 1.253 · d/ n. We have calculated that, for k 8 n, rms * (f , k) = a · rms(f ) where = a 1 + 0.101k2 .

f is (k, a)-resilient for this value of a.


We implemented this enforcement with an authorization manager that is also installed as, and inherits from, the Java SecurityManager [30].

our TMI reference monitor accurately models system-level access control in Java.


Photography is a single-objective task, whereas security design takes place as part of a multi-objective engineering process.


In our e.ort, we have limited ourselves to approaches that rely solely on sensors that are already part of commercial o.-the-shelf devices a multi-touch sensor in particular.

we do not have the bene.t of using such palmprint texture [15], vein pattern, 3D features [22], etc.


The newly issued credential and the root credential share an attribute that never leaves the smart card.

whenever the user proves knowledge of the ID credential, knowledge of the root credential must be proved in addition.


We now examine protocol ECKE-1 in relation to the security attributes de.ned in section 2; informal arguments are provided to support our claims: KK-S: Every session key sk is uniquely derived from the random ephemeral keys rA, rB and the static private keys wA, wB (through construction of eA, eB , dAdB).

an adversary with known session keys but no information on rA, rB, wA, wB , has a negligible probability of mounting a successful attack against any run of the protocol since extracting this data requires (at least) tractability of the Elliptic Curve discrete logarithm problem (ECDLP).


It leaves open what computing can be done in the session.

the session can be an e-commerce session where the data sharer is a buyer and the data observer is a seller, or an e-learning session where the data sharer is an elearning provider and the data observer is a student, or any other type of information sharing session that requires privacy protection.


The addition of new devices may also enforce applications to adapt its nature in order to achieve optimal behavior.

the smart assisted living environment must adapt its algorithmic behavior.


Since there are 256 encodings per movie, the outer code has its alphabet size 256, and the length of the outer code 255.

we pick 255 movies as the size of one cycle and each movie has 256 di.erent versions.


One natural choice is counter (CTR) mode [8]; however, CTR mode is a stream cipher mode of operation, and shares all the problems as any other stream cipher.


with respect to the validity checking issue, encryption using IBC does offer an advantage for DTNs compared to encryption using traditional public key cryptography in the usual manner.


However, WinSEND is just interested in ICMPv6 messages that are related to NDP messages and left the normal TCP/IP stack to handle the other traffic.

all other traffics that are not related to NDP should be filtered out.


INTRODUCTION The consequences of unauthorized access to digital document content can be severe when a .nancial statement is modi.ed, a con.dential business document is disclosed to the public, or a design speci.cation (e.g., in automotive industry) is leaked to a competitor.

.nancial institutions, governmental agencies and manufacturing companies all face the problem of controlling sensitive documents information when processed and exchanged among several parties within and beyond their boundaries.


We should note that decryption .ts in the processor s pipeline and no extra cycle is spent on it.

we expect no runtime overhead from the hardware decryption part.


1) and run the malware on the sensor nodes.

most software-based attestation protocols such as SWATT [7] and SCUBA[8] sets a timer right after it sends out the challenge.


We designed the initramfs to run without user input, and without possibility of interruption.

a single PCR extension by GRUB representing the initramfs is su.cient to guarantee the system is in a trusted con.guration once the initramfs .nishes.


5.4 Limitations The current version of the prototype has not been tested with CardSpace relying parties using TLS/SSL.

we are not able to provide precise operational and performance details in this case.


Samsung has since up dated the package, which is no longer .agged as malware, but continues to use the same the version code (1) for all ver sions.

matching resulted in devices containing all variants of this package (7845 devices in the Carat dataset) being labeled as infected.


Nevertheless, there are signi.cant di.erences to our system, since we are aiming at the analysis of malicious code and not at preventing its execution.

we intentionally permit the execution of illegitimate code after extracting it.


Furthermore, plaintext-awareness is achieved by cryptographic transformations[26,27,36] that convert encryption schemes that arejust semantically secure under chosen-plaintext attacks[29] into IND-CCA-secure schemes.

it was a widespreadbeliefthatplaintextawareness was necessary to achieve IND-CCA security.


The KL detector showsbehavior similar to thePHADin the networkdomain; i.e., the nextADSscore canbepredictedgiven veryfewpast score values.

we predict scores for STIDE, SVM and KL detectors using eight, nine and one prior scores, respectively.


However, the same Bloom filter index is sometimes created from elements that have different values, since the same hash digest can be calculated from different values.

other element in database is sometimes mishit to search on Bloom filter index and the mishit is called false positive.


Instead, they are called with content resolvers as the mediation.

we hook and tweak the corresponding APIs using the Cydia Substrate3: ContentResovler -query  ContentResovler -openInputStream  The interface of openInputStream is also monitored because photos are accessed in a di.erent way from the other types of sensitive data supported.


Table 1: Simulation Parameters Parameter Description Value/Range Computation a Proportional gain 0.1 ß Integral gain 0.9 Setting .1 Positive derivative gain 0.05 .2 Negative derivative gain 0.2 Environment g Fraction of compromised guards [0, 1/3, 2/3, 1] Setting d Drop rate by compromised relay 0 = d = 1 f Transient network failure 0.21  21%.

we set the circuit failure rate, f to 0.21 in all our simulations.


So any member in the subnet would lead to traffic on the subnet.

our approach is complimentary to the approach in [1].


Unlike recent work to address these concerns [51, 52], SSC does not rely on nested virtualization.

client VMs are able to enjoy the bene.ts of SSC with negligible performance overheads.


The notion of d-consistency is useful, since it p1 p2 p3 p4 p5 u1 0 1 0 0 1 u2 1 1 1 0 1 u3 1 1 0 1 1 u4 1 1 1 0 0 Table 1: User-privilege assignment helps to bound the degree of approximation.

we now de.ne the approximate Role Mining Problem using dconsistency.


Therefore, group N - N - N leader-L1leader-L2 C join = × Cgroup (2) N where C is given by: group group group Cgroup =Cupdate + Crekey (3) with group member C = H × M + H × N × M update leader leader member member update (4) and group region-memberCrekey =H region × Nmember × M update (5) The cost for group leave event includes three cases: non-leader member leaves, L1-leader leaves, and L2-leader leaves.

the cost for group leave event is: non-leader leader-L1 leader-L2Cleave = Cleave + Cleave + Cleave (6) with N - N - N non-leader leader-L1leader-L2 Cleave = ×Cgroup (7)N leader-L1 change Cleave =Pleader-L1 × (Cgroup + C ) (8) leader-L1 leader-L2 change Cleave =Pleader-L2 ×Cleader-L2 (9) L1 L2 Pleader-L1 =N L1 / N L1 + N member + N member (10) L1 L1 L2Pleader-L2 =N member / N L1 + N member + N member (11) where C is given earlier in Eq.


For instance, we may wish to allow an access purpose to be used by a set of users only in a speci.c time interval (e.g., business hours) or only when the users are logged into speci.c machines (e.g., machine identi.cation number).

the system information that a.ects the access purpose authorizations must be clearly de.ned and available to the access control system.


The entropy of this class of triangulation with a boundary is however a =2.17 bits per face (plus a ßk lg m term to take into account the number of sides into which the boundary is divided).

the additive part of the entropy leads to a representation which is compact, but succinct only for class of triangulations with a boundary (recall that the class of triangulations of the sphere has only entropy 1.62 bits per triangle).


We asked participants how they created the passwords used in this experiment, whether they used these passwords for other accounts, and how strong they believed these passwords were compared to their other passwords.

before accessing the survey, we asked them to login again to ensure that the password that was the subject of the survey was fresh in their minds.


When the reflex agents report an alarm, all the other agents are not relevant as something is very wrong and demands urgent action.

the reflex agents trigger an alarm and the integration agent is just informed.


However, de.ning what an anomaly is and developing anomaly detection algorithms for computer network activity is still a challenge.

new approaches focus on narrowing the scope to improve visibility, using additional data sources, or combining multiple techniques to achieve lower false positive and/or higher true positive rates.


Among these core-dependent components are the SMM_Addr and SMM_Mask MSRs that de.ne the SMRAM memory range.

each processor core can have its own protected SMRAM memory range that is independent from the SMRAM memory range de.ned on other processor cores that share the same node.


However, there is a problem that the accuracy of characteristics on flick input is unstable since users freely make their postures when they use their smart phones.

in this paper, we improve the method with acceleration sensors which acquire postures of users.


However, when receiving a phone call from a foreign party, the exit code is already contained in the incoming foreign number.

when returning such a call, the exit code is often attached automatically by the mobile device without the user s knowledge.


However, .ngerprints corresponding to worm packets should appear with a frequency determined by the number of worm packets observed in the observation epoch.

given a suf.ciently large observation epoch over which one observes multiple worm packets, and a .ngerprint universe that is signi.cantly larger, one can create inverse distributions where the .ngerprints that appear only in the background traf.c are essentially squashed against the y-axis.


Sending and receiving messages follows the Dolev Yao model, where the intruder has complete control over the communication and takes on the role of the environment.

whenever a principal sends a message it is sent to the intruder and whenever a principal receives a message it has been sent by the intruder.


In the previous step of the proof, we have generated with F , two (concatenated) computationally pseudorandom and independent .-bit strings which can be used to key Nmac.


Detecting a communica  Figure 1: Basic ideas tion carried out to transfer the program itself in order for the program to infect another terminal when the malicious program any were present in the LAN.

remove malicious programs easier by .nding the infected from the history of communication even if the infection and prevention of infection has been successful it is possible.


This property remains true even if we apply our substitutions, that is N-1( Sdns) .N-1(Sdns).

a superset protomatcher recognizes any attack instance recognized by the full-coverage protomatcher and some additional tra.c.


Most monitors and laptops today have built-in cameras, and we expect eye tracking technology to become more affordable in the near future, so it could have a place in everyday user interaction.

eye tracking could be used by a variety of applications with properties similar to CGP: a very short time period of use with potentially long time periods between uses.


As the Bayesian network is generated based on accepted domain knowledge, it conducts its calculations based on an approved network structure and conditional probability tables that have been built based on accepted node weightings.

our experiments did not show any non-intuitive output or changes in output vales that could not be justi.ed with the corresponding input value changes.


4.6 DAA-Signing Protocol We now describe how a platform can prove that is got an anonymous attestation credential and at the same time authenticate a message.

the platform gets as input a message m to DAA-sign.


In our tests, QR s error correction worked much better than Data Matrix s, which is probably the consequence of employing multiple FEC standards over the time and not having all readers support each of them.

currently, the QR symbology provides the best host platform to embed other codes.


Therefore, to determine whether X satis.es a 5CF term, one can .rst determine whether X satis.es each of the 4CF sub-terms, and then combine these results using logical conjunction and disjunction.

for a 1CF term f, if it is a unit term, then it is straightforward to determine whether X satis.es f, because a unit term can be satis.ed only by a singleton set, and because of the de.nitions of n and U.If f is of the form t+,where t is a unit term, then one just needs to determine whether each user in X satis.es t. one can ef.ciently check whether X satis.es an 1CF term.


This means, that once a platform has the keys con.gured for the corresponding security service, it would be able to access documents within the ERM-TVD as long as the keys are valid.

a mandatory requirement for revocation of an ERM-TVD membership is the revocation of the corresponding keys.


Moreover, our constructions support a large-size of role hierarchy with arbitrary structures.

we believe our schemes can be applied to large-scale role-based cryptosystems, such as healthcare and .nancial systems.


When the mimic functiondigests two sequences of symbols that share a common subsequence with interdependencies longer than the order of the mimic function, the interdependencies will be partially merged.

it is possible for the mimicry output to contain long symbol sequences constructedbymixing and matching the originalparts.


On the .ip side, MIP asks for the cooperation of code producers to attach chunk tables to modules.

mIP is not designed to work on off-the-shelf stripped binaries, but provides support to code producers who intend to harden their applications using IRMs.


Later on, if the knot initiates a JREP it will synchronize the pseudonym of the new established route to its united pseudonym (Kseed1 ) in the same way.

if a received data packet is forwarded by a knot only once using its united route pseudonym, all of the knots connected to it will receive it.


Sybil and Node replication attack: Each node is assigned with a unique identity IDs and corresponding secret KS.

it is not feasible to have more than one ID for the same node S. 4.


If it is not added, it means (ar, c, val).. can_addak-1 and (ak-1, val) cannot be added.

other attribute values which depend on these attribute values are unreachable.


However, the issue of exploitation is far more clear cut  a vulnerability is either exploited or not and the date upon which a working exploit becomes known is frequently documented.

in this paper we focus on the exploitability aspect of severity.


Simultaneously, the translation engine translates the logging information recorded by the much faster hardware-assisted VM into the form that the analyzing binary translation based VM can understand .

the later-on replay can be done on a heterogeneous VM.


After one last next-ror with |R3| = 20, S1 remains the same, S2 = HK(S4||S2||S1) = HK(4||R2||R2), R3 = S2.

a obtains a 20-byte string in the last next-rororacle that is predictable (R3 = HK(4||R2||R2)), whereas this event should occur with probability 2-80 .


Secondly, various motivations can cause the cloud to behave unfaithfully and return incorrect results [4].

customers are in great need of secure computation outsourcing mechanisms to validate the results returned from the cloud are correct.


When the shapes of the distributions di.er signi.cantly, the resulting value becomes large.

we can also use this for the weight calculation.


Clients can execute their work VMs atop the nested VMM, which in turn has its own management VM.

clients can implement privileged services within the management VM of the nested VMM without relying on the cloud provider to do so.


Table 1: Common data .ow instructions Mnemonic Op1 Op2 Movement Instructions mov r/m r/m/imm xchg r/m r/m push r/m/imm NA pop r/m NA lea r r/m Arithmetic Instructions add r/m r/m/imm sub r/m r/m/imm inc r/m NA dec r/m NA mul r/m NA Logic Instructions and r/m r/m/imm not r/m NA or r/m r/m/imm xor r/m r/m/imm Key r: Operand can be a register m: Operand can be a memory address imm: Operand can be an immediate value NA: Operand not used Edge Confusion Factor is de.ned as ECF = (OE -UE) / OE, where OE is the count of control .ow edges in the original program and UE is the number of original control .ow edges which remain in the obfuscated program.

eCF is the percentage of original edges in the control .ow graph which have been hidden through embedding.


Network-based attacks: At no point, passwords nor authentication tokens are transmitted over the network.


Similarly, consumers can develop and enforce policies that address their security concerns without having apriori knowledge about security needs of diverse applications.

mCC provides a scalable framework for permitting the networked distribution of end-user software applications while addressing security concerns.


We did not test Capture-HPC on the SQL injection dataset and the malware forum dataset, since the attacks contained therein have long been inactive (e.g., the web sites that hosted the binaries downloaded by the exploit were unreachable).

capture-HPC would have reported no detections.


We assume that as a direct result of self-awareness property, we are always aware of CPU utilization by any process.

any unusual rise in CPU is detectable and can be taken as danger signal.


But that means that the earlier solution is not minimal and we have a contradiction.

the solution to the tiling databases problem directly maps to a solution for the role mining problem.


For record sequences, the system can only identify those in which all records are structurally identical.

it cannot identify complex record sequences such as those in HTTP, WMF, JPG, PNG and TIF.


4.3 Analysis of the Eucalyptus SecurityFramework Eucalyptus Framework is an open source private cloud provider.

there was no need for an extensive black box analysis.


Hence, the attacker tries to .nd p, q, or d. Since the size of the key is very large, e.g., 1024 bits, the exponentiation is (even on todays very powerful PC platforms) still very expensive in terms of the execution time.

actual implementations of RSA usually employ very e.cient and optimized algorithms to accelerate the result of this operation.


Once user s data is hosted outside of his/her local computer, a degree of control over his/her privacy information may be lost.

a variety of threats may arise and result in hazards to the user.


It also encompasses a Group Graph Model [15] which allows users to be put into groups, which are simply sets of users.

assigning a group to a role allows one to assign an arbitrary number of users to an arbitrarily large set of privileges with one operation.


The common elements correspond to the same parent nodes they share, and the number of di.erent elements correspond to the levels that they need to be generalized to their common parent node.

the shortest path is the total number of di.erent elements in two Hcodes.


To show this, we prove that an adversary that computes a linear combination of the checking equation for a set of inputs X , can also resolve 3-SAT on this same set X : given any 3-CNF F, it can .nd a satisfying assignment for F in X (if one exists).

under the Bounded Speedup Hypothesis, the set X must be of polynomial size, and the adversary can be simulated.


We also observe that PREC never misclassi.es a system call from Java as a system call from third-party native code.

pREC will not raise any false alarm for those benign applications that do not include any third-party native code.


Since each random tape is used only once, distinguishing our converted signature scheme and the intermediate scheme is breaking the pseudorandom function.

our converted signature scheme is EUF-CMA deterministic signature scheme.


First, it sends a request-to-send (RTS) packet to the receiver, which responds with a clear-to-send (CTS) packet.

the channel is reserved for the transmission.


DETECTION APPROACH We have seen that sophisticated JavaScript-based malware is dif.cult to detect and analyze using existing approaches.

there is the need for a novel approach that overcomes current challenges.


[D] is outsourced and stored at P1, and only P2 has the corresponding decryption key.

[D] and [u] cannot be decrypted by P1 without accessing the decryption key.


Furthermore, keyed one-way hash functions include a key as an additional argument.

we may have: f(x, y + z)= h(f(x, y),z) where f is the keyed one-way hash function, h is the compression function, x is a key, and y + z represents the concatenation of block z to y. Concatenation (+) associates to the left.


We have shown that our features characterize very well the types of attacks that are performed today.

attackers would need to .nd completely new attack classes.


We .lter outliers in both directions because when large fraction of the guards are compromised, compromised exits tend to obtain a higher reputation score (as majority of the circuits have a compromised guard in such scenario) compared to the other honest relays.

under our assumption a high reputation score does not always imply a trustworthy relay, rather a reputation score in the vicinity of the expected reputation score implies (probabilistically) a trustworthy relay.


The time interval of maintenance messages will be usually quite long to lower the communication cost.

this approach often leads to long delay for event messages to reach the base station.


MLS in the context of SELinux MAC enforcement, however, may or may not conform to the formal descriptions and properties (star, simple security, etc) historically given in literature.

we must leverege a methodology for analyzing SELinux, and extend it to form a good functional analysis of SELinux coupled with MLS.


Because of a preference of usability over security, visual security cues are often disregarded by users.

our challenge is to design and build a security solution that gives more value to users than the value of the e.ort required to use it.


A role view defined by a set of roles {r1, ,rn}is a sub-graph of the of the overall role graph with the following properties: 1. the view contains r1, ,rn as nodes; 2. if the view contains a role r, then it contains any user or role q such that q.r; 3. the view contains no other nodes except those included by rules 1, 2; 4. the view contains an arc q.r iff q and r are included in the view and q.r is an arc in the original graph.

to define a view it suffices to indicate the most general roles contained in that view, which are called principal nodes of the view.


In other words, if we consider each gadget as a monolithic instruction, the stack pointer plays the role of the instruction pointer in a normal program, transferring the control .ow from one gadget to the next.

gadgets are initially de.ned by Shacham as useful snippets of code that terminate with a ret instruction [29].


3.4.1 Revocation of Rights in Authentication Login records in database may be kept entirely encrypted so the database administrator would not be able to analyze contents such as field of IL or names.

records are decrypted and encrypted while retrieving and storing them.


[9] observed that these system level mandatory access controls only seek to enforce security at application granularity and can not monitor the data handled within an application.

it still does not resolve the problem we target at.


We encrypt every message using this shared key and add a hash value.

it is difficult to read or tamper with the content of the message.


Register name Needs locking Locking condition Unlocking condition Authorized modi.cations SP CF SP CF SP Start SSCR No Partial Yes Yes N/A After First Write After First Write After First Write N/A Reboot Reboot Reboot Any Internal to CF instructions None None (b)New registers locking logic Figure 4: Stack con.gurations and control .ow stack pointer description and additional locking logic are 16 bit values and are modi.ed with two instructions.

the update of the stack pointer is non atomic anditsvaluecanbetemporallyinvalid.


An unprivileged VM has no direct access to hardware, and cannot directly access a .le in Dom0 that contains another VM s secondary storage.

it cannot undermine the con.dentiality or integrity of secondary storage, unless aided by Dom0.


However, as recent experience shows, assuming that users can simply trust the PS system they contribute sensitive data to, is no longer a viable option [16, 17].

it is imperative to address privacy concerns because users perceive them to be signi.cant; as a result, they may refuse to use or even oppose a service.


The code for each website changes on each visit.

we ran our enhanced Chrome 10 times on each website.


The McAfee threat report [8] for the .rst quarter of 2012 stated an abrupt rise in the number of smartphone malware with Android on top of the targeted platforms making it the most attacked mobile os.

the increasing security problems of smartphones are becoming a real concern for users as well as enterprises.


In step 3, we develop a signi.cantly smaller set of representative users that represent each cluster.

steps 1-3 can be viewed as the process of building a compressed dataset.


Thereby, no verifying party except the originator and the proxy learn anything about the unused choices from the message template given a message signature.


Being part of the discovery mechanism, unde.ned attributes are shared without any additional communication cost.

witnesses are what we call like-minded familiar strangers -people who we do not know (strangers) but we meet very regularly (familiar) and we share interests with (like-minded).


If there are no quasi-identifiers, the data is unidentifiable in the sense of discovering sensitive information regarding a specific entity.

the given information can leak only statistical information.