Based on our hypothesis, compute-bound applications that have a stable working set throughout their lifetime will have the lowest overhead.

i/O bound applications with highly variable working sets will be the pathological cases.


In the .rst-try protocol, the session key is com (eA+SA+zA)(eB+SB+zB) puted as ssk = g, so it seems that if an adversary does not learn all the partial secrets of either party, then the adversary cannot compute the session key.

the protocol is insecure, consider an adversary who performs a similar attack as that against the HX protocol we described in Sec.


As the genetic algorithm moves through its generations, the average Hamming distance should decrease in value, corresponding to some agreement on secure settings.

in order to maintain chromosome diversity, the average Hamming distance must not become too small.


If the attacker has a generative model, it can then break PEES.

to be successful the attacker must have access to a generative model and have physical contact with the mHealth user, which can be avoided.


If restricted contexts have direct access to a user s password, private keys for TLS [9], or Kerberos ticket cache [11], then the untrusted code can authenticate itself as the user to another machine without the restrictions by implementing the authentication protocol itself.

by exposing only abstract authentication operations, such as the GSS-API [14], the operating system can ensure that the authentication protocol carries restrictions to remote servers.


Organizations also use mobile device management (MDM) solutions to enforce password policies on BYODs to protect corporate data.

a recent survey found that 56% of smartphone owners do not con.gure PINs or pass-locks on their devices [24].


LAMPORT SIGNATURES The basic idea behind Lamport signatures [33] is fairly simple.

there is a wide variety of performance tradeo.s and optimizations associated with it.


The re-encryption of large amounts of data must be done in a timely manner, especially if required for a key compromise or algorithm exploit.

the time to apply the new encryption technique to a large amount of data will probably not be the limiting factor; rather, issues with maintaining keys and actually reading all of the old data quickly will be critical.


The existing GSP is not strategy-proof, and neither is our mechanism.


Alternatively, one may consider building a universal classifier for all the viruses.

there are two problems of building such a classifier.


So, given the query response of m queries, an adversary can generate m+ 1 m(m- 1)+ k constraints to the optimization problem 2 presented in (1).

caution must be exercised in generating constraints when some of the domain values of the attribute A are devoid of any data points.


Load shedding is proposed as a defence to overload attacks in the Bro NIDS [13].

the discarding strategy is not discussed, so the NIDS operator is responsible to de.ne one.


the time an operator stays in a database is too long or an operator logins to a database too many times) is not suf.cient to determine privacy intrusion with high certainty.

an operator, for his/her job, should be allowed to stay in the database for any length of time, and should be able to login to the database any number of times.


Technically, the network model does not have internal Poisson flows.


Several approaches have been suggested for identifying self-decrypting shellcode using emulation [15, 27, 2] or dynamic taint analysis [26].

these detection methods are based on a number of assumptions that do not necessarily need to be so.


In biometric systems where image processing techniques are mainly used, it is impossible to achieve exact biometric matching due to estimation problem, that is exactly estimating the registered image given the query image.

we approach the estimation problem from a postprocessing persp ective where derivative information of the registered template is used to transform the query template into another template that can be used to perform an exact match with the registered template.


Of course, an attacker may think of using virtual camera software as well as a Trojan that can modify the sensor readings at the same time.

it requires that the virtual camera and Trojan cooperate together and synchronize perfectly, which is difficult and significantly raises the bar for breaking into the authentication system.


This allows a signi.cant amount of memory space to be saved when there are many identical pages.

this technique can also expose unexpected security vulnerabilities.


With the help of preauthentication and key-caching, IEEE 802.11i is expected to perform reasonably well for operational environment.

the exact performance of the protocol suite is not widely evaluated yet, and is a function of a variety of factors.


100p1+ x2 100 -1/100 the probability that there exists an i such that |yi|= T is at most 2n -T 12n ==1/100 p-8 1+ x2 Tp for T = 100n.


Most existing scanners use .le or network .ow as scanning granularity.

to help web application developers, most browsers have the ability to let scripts include other scripts.


Jamming can only prevent unsolicited actuation, it does not provide a solution to message spoo.ng from sensor devices.

in a home automation context, actuation is the more safety critical aspect.


Power distribution network is intuitively the same as the legacy power network which is responsible for power generation, transmission and distribution to the consumers.

communication network is responsible for monitoring di.erent devices in the smart grid, thus providing the ease of management and e.cient energy consumption.


[47]introducedabehavior-basedbotdetection method, which relies on discrepancies in action frequencies betweenhumanplayers andbots.

compared to our work, the metric used for their detection, action frequency, is coarse-grained and has low discriminability, resulting in low detection ratio (0.36 recall ratio on average) and long detectiontime(atleast15 minutes).


Android provides a permission system for protecting their system and communications between applications.

the permission system can cause an application seeking to use only a subset of that functionality will be over-privileged because a single permission deals with a varying set of API calls.


XOMOS [18] provides an example where an attempt to add protection against OS attacks to XOM resulted in requiring signi.cant OS redesign.

secureME is designed from bottom-up to make the interaction between the secure processor substrate and hypervisor synergistic, in order to provide the desired protection while meeting the other goals of low performance overheads, compatibility and ease of programming.


For a large production kernel such as Linux, specifying the complete set of invariants is not likely to be tractable.

to provide effective security, OSck need only check invariants that rootkits can violate to implement meaningful malicious behavior.


Most of the errata require kernel mode instructions, thus must have been implemented in a Windows driver component.

these CPU de.ciencies or bugs are strongly bound to CPU models, thus the feature tests can be e.ective only on certain CPU families (e.g., Intel Core 2 Solo).


biometrics based systems provide a reliable solution for recognizing individuals.


Implicit in this statement is the assumption that customer records can be easily identi.ed and that there is a policy control in place that forces the encryption of such information.


Because of this tension, it is unlikely that we can re-issue certificates as frequently as we would like.

we can achieve some of the benefits of frequent re-issuance without the costs by requiring timed revalidation [17] of certificates.


However, the average extraction time is 5s and the time taken to classify a sample is 56s.

the time taken to compute GIST feature is 54ms and the overall classification time was 1.4s.


To detect incoming C&C messages, the detector needs to know the encoding scheme probably through binary analysis so that it can intercept and delete malicious messages before any application s access.

the botmaster can apply advanced packing and obfuscation techniques to make the binary analysis harder, and periodically update the spam templates as well as the mapping between them and corresponding commands.


Robusta alreadyprevents code-injection attacksin native librariesbecause all codeis statically veri.edbefore execution and no memory regionisbothwritable and executable (these invariants are also maintained during dynamic loading).

it does not prevent exploits of vulnerabilities using code snippets already in the code region (e.g., return-to-libc attacks or return-oriented programming [27]).


POSTER: Identity-Based Steganography and Its Applications to Censorship Resistance Tim Ruf.ngSaarland University Jonas Schneider Saarland University Aniket Kate MMCI, Saarland University Saarbrücken, Germany tim.ruf.ng@stud.unisaarland.de Saarbrücken, Germany s9joscne@stud.unisaarland.de Saarbrücken, Germany aniket@mmci.unisaarland.de ABSTRACT The use of public-key steganography has been proposed for several censorship-resistance systems.

distribution of the employed public keys presents an availability, scalability, and security challenge in many of these.


Cloud computing has been used to protect mobile devices, including malware scanning [28] and dynamic analysis of apps [29].

the platform is also abused by the adversary, who uses push-messaging services as a command and control channel for botnets [5, 35].


Comparison of I-cache Analysis to Data Cache andBranch Prediction Analysis Data cache attacks try to reveal the data-access patterns of cryptosystems.

we reveal the instruction .ow of cryptosystems in I-cache analysis.


The components include: (1) an identification number for each syllable; (2) a value for the duration of each syllable; (3) values for the frequency ranges of the syllables; (4) values for average duration of the phonemes; and, (5) a ranking of the frequency levels.

the platform cannot locate the user s voice file using the phonetic alone.


The area covered by node N2 already intersects with only two rules R1 and R4, so it becomes a leaf.

the nodes N3 and N4 intersect with three rules each, so they are cut again at points X3 and Y1, respectively.


It is entirely possible, for example, to conceal terms in the EULA which strictly forbid the software s use in the manner outlined in this paper.

this prophylactic is not likely to be e.ective, as adware/botnet groups are reluctant to emerge from the underground community and press legal charges.


Basically, it means that a guest VM with a directly assigned device can also use this mechanism to signal an MSI to a physical processor via a simple DMA write operation.

this can be fatal for a system as an arbitrary interrupt vector could be called from unprivileged guests [9].


In our earlier work [31], we used an XFA de.nition that associated instructions with edges rather than states.

edgebased XFAs are equivalent to state-based XFAs semantically, although state-based XFAs require more states.1 combination, matching, and optimization algorithms are more e.cient for state-based XFAs.


INTRODUCTION Hardware Trusted Platform Modules enable software attestation and sealing of secrets to both client and server systems.


In these cases, Ad Hoc Networks have the additional appealing feature to be able to operate in an unattended manner.

this comes at a cost: Ad Hoc networks are vulnerable to different kinds of novel attacks.


As the issuance of Domain nodes and Domain links are the same as the issuance of User nodes and User links, existing protocols can be used to facilitate local domain management.

new node attributes are added to the Domain node in that it contains a Domain ID as its identi.er and a reference to the Domain Manager,where a Domain UPnP UUID is used to uniquely identify the Domain Manager in UPnP context.


The problem of MCS is that, given two graphs and we would like to .nd the largest subgraphs which are isomorphic.

the MCS isomorphism problem is an optimization problem that is known to be NP-hard ([16]).


According to the C standard [25], this would result in unde.ned behavior if the out-of-bounds calculation was larger than 1 element outof-bounds and as a result we could terminate the program.

as noted by CRED [36], a signi.cant amount of programs that are not vulnerable to bu.er over.ows will perform out-of-bounds calculations that are larger than 1 element out-of-bounds.


on laptop theft [6] could serve as an inspiration for evaluating the approach empirically.

contrary to these experiments, penetration testers would need to play multiple scenarios to get meaningful data.


In fact, the next operator after the shift provides no more uncertainty because to obtain the expected value it is su.cient to know the centers of the .nal obfuscation region.

both Example 2 and 4 hold the known-position-indistinguishability property since they provide di.erent obfuscation regions in time.


Thus claims 8 -11 imply that the advantage of any PPT adversary in distinguishing Hybrids 1 and 5 is at most 2(v + 1) ·EP RG , where EP RG is the maximal distinguishing adversary of any adversary in distinguishing the output of the PRG.

any adversary distinguishing Hybrids 1 and 5 distinguishes the output of the puncturable PRF.


The CAC isolates a user s private key from the rest of the system.

the system also uses commodity software on a legacy OS.


2.2), thus saving both time and hardware resources.

our architecture always provides the correct result.


That is, the CS is trusted to honestly perform operations requested by the DBUs according to the protocol speci.cation.

the CS is not trusted to guarantee data con.dentiality and it It is assumed that there are mechanisms in place for data integrity and availability.


In modern computing systems, this task is so overwhelming that it is rarely done (i.e., certi.cation, veri.cation, and monitoring of entire system stacks).

consider remote execution of a browser in a virtual machine (to take one popular suggestion) over a display protocol like RDP or VNC; if the remote virtual machine is compromised, one need not immediately worry about local data, as the attacker must attack the only communications link between these two environments.


This might be a realistic approach in certain scenarios in which a .xed number of nodes is statically deployed and the attacker does not know anything about the to-be-installed sensor network.

in a dynamic environment with new nodes joining or leaving the network from time to time, this approach is inappropriate.


2.2 Motivation Existing work [14, 21, 33, 40, 49] on behavior analysis has mostly used system calls to depict application s internal behaviors.

previous work has problems when applied to Android platform due to Android s new security model.


Consequently, the conditions recovered by hook analysis can be used to infer arguments during hook placement.

for kernel functions, we only need to infer if there exist arguments such that the kernel function performs a conceptual operation.


In addition, as Twitter is text-based, email spam .ltering techniques are also relevant [17, 41, 44].

twitter posts are much shorter than emails and spaced out over longer periods of time than for instant messages, e.g., hours rather than minutes or seconds.


For instance, he may decide to investigate why a cluster of users is not ful.lling an obligation and if appropriate, he may remove the obligation from the policy.

outliers with a high number of obligation(s) violated may represent lazy, absent users or employees that may have higher risk of becoming insider attackers.


If we assume that the key is not known to attackers, but other con.guration parameters can be known, an attacker has to accurately guess the reporting time from a range of values such that success ratio will be above the property threshold in order to evade detection.

this accuracy (evasion) is highly dependent on the parameter randomization range.


A perfectly acceptable IDS signature may look for this particular DNS query and block the communication, thus preventing the malware from further interaction with the remote controller.

a DNS query may be legitimate traf.c issues with the purpose of determining the IP address of a server that is used to save high score data in a game.


Both approaches instrument function prologues and epilogues to incorporate a return address check on each function return.

as we already described in Section 2.2, both approaches are not able to detect ROP attacks that use unintended instruction sequences because they only instrument intended function epilogues.


Poster: A Hybrid Botnet Ecological Environment Dai Yumei Liang Yu Li Ke Beijing University of Posts and Beijing University of Posts and Beijing University of Posts and Telecommunications Telecommunications Telecommunications daiyumeibupt@gmail.com liangyu@software.cit.ac.cn like@software.ict.ac.cn ABSTRACT Research into defense against botnets, especially countermeasures against the command and control (C&C) protocol, has become increasingly significant as several large-scale botnets have resulted in serious threats on the Internet.

most existing research efforts lack safe and efficient analysis platforms for C&C protocol fuzzing.


during impersonation, a thread inherits the token of the process that it is impersonating.


By blocking bots from flooding the sites with scams, eBay could improve its marketplace.

it must be noted that breaking the different types of captcha is a common act perpetrated by hackers.


Of course, with increasing sequence length, the corrected conditional entropy test would lose its ability to measure regularity, because of the issues discussed in Section 3, unless the sample size were increased.

this is not a signi.cant threat, because replaying long correlated sequences of inter-packet delays would greatly reduce the capacity of TRCTC.


As depicted above, this module is capable of detecting and recovering from patched system calls, hidden files, hidden processes, and hidden network traffic.

it is not capable of protecting against removal or modification of data on the hard drive, the exposure of sensitive data, and the collection of keystrokes by a sniffer (which may include passwords, and so on).


The SIM card (Subscriber Identity Module), present in most mobile devices, constitutes a dedicated TEE where security-sensitive services, that withstand mobile OS compromise, could be implemented.

services implemented on SIM cards are limited to isolated computations, and, furthermore, deployment of global services on SIM cards is challenging due to a large number of mobile network operators involved in the process.


For web content, an origin is defined as a combination of scheme, host name, and port number [4].

this definition is insufficient for the origin protection on mobile platforms: here we need to consider not only web origins but also app identities and other local origins.


bTolven eCHR provides a log entry when the action occurs.

the log entry states that the action was add instead of update or change  Table 4.


[5] proposed a naive approach, called as BSW s scheme, by using Bitwise-comparison operators based on AND/OR operators.

this scheme has following shortcomings: · It cannot support dual comparative expressions, where two range-based comparative constraints must be embedded into the outsourced .les as well as the user s private key.


Finally, tools have been developed enabling the automatic identi.cation of instruction sequences and gadgets [32, 38, 22].

rOP can not bypass address space layout randomization (ASLR), a well-known memory protection mechanism available for Linux [49] and Windows [31].


That is, the judiciary at each level holds the power to overturn legislation and executive directives if they are judged to violate constitutional principles.

the greatest power held by the judiciary is the ability to arbitrate elections disputes.


#correlated alerts Counting the numbers in Rc and Rs is easy, given the description of the attacks in the DARPA datasets.

realSecure generated duplicate alerts for several attacks.


Thus, in an ideal case security metrics produces the real number value.

in most situations an indicator that produces level information is sufficient for the self-adaptive security.


Some text in this electronic article is rendered in Type 3 or bitmapped fonts, and may display poorly on screen in Adobe Acrobat v. 4.0 and later.

printouts of this file are unaffected by this problem.


In OAuth 1.0, each access token is bound to and can only be used by the relying party the access token was issued to.

an access token in OAuth 2.0 (which is also referred to as a bearer token ) can be used by any party in possession of this token [28].


Zero-knowledge watermark detection is a promising means to overcome this problem and to improve the security of digital watermarking schemes in the context of various applications: it allows to cryptographically conceal the information required for the detection of a watermark and to prove the presence of the hidden watermark by e.cient zero-knowledge proof systems.

concealing the watermark prevents the verifying party from performing additional checks on the watermark, e.g., on its probability distribution, which may be required for certain applications.


Between November 2011 and January 2012, we gathered 7824 responses from 271 distinct participants.

since online surveys are not taken seriously by everyone, we discarded records that do not seem to represent a genuine e.ort to complete the survey, as well as responses that werenot usable forsomeotherreason.


1One might think that a more generalized Hidden Markov Model, such as one that uses Gaussian mixture emissions [7], would give better results.

the HMM with Gaussian mixture emission has a much larger number of parameters and thus faces the over.tting problem.


4.4 User Characterization Each of these three previous visualizations has extended the concreteness and immediacy of the original Swirl interface with mechanisms to make aspects of history available.

the history that has become manifest in these views is the history of a particular session, or the part of the session that any given user might see.


Photuris, an early proposal for IKE, introduced the concept of a stateless cookie, intended for DoS protection.

the stateless cookie mechanism cannot protect against a DoS attack unless the receiver can successfully receive the cookie, which it will not be able to do if reassembly resources are exhausted.


Across all three con.gurations, CPU and Memrand show the least interference, indicating that Xen does a good job accountingforCPU usage and thattheprocessorlimitscontention for memorybandwidth.

for all other resources, there are competing workloads that substantially degrade performance.


That is, Pf (Af (x) = a) = 2-a Note that for univariate and multivariate Gaussians, this de.nition agrees with the typical de.nitions of anomalousness, which are either based on the z-score or Mahalanobis distance.

this de.nition is much more general, since it applies to multivariate Gaussians, discrete distributions, and (with some additional work) stochastic processes.


Consequently, the attacker can corrupt writable memory between any two instructions in the user program.

it is assumed that machine registers of a thread cannot be directly modi.ed by the attacker thread.


Current researches on mobile privacy mainly focus on potential leakages on a particular device.

leakage of sensitive data on a mobile device not only violates the privacy of the phone (or data) owner, but also violates the privacy of many other people whose information are contained in the data directly or indirectly (they are called data involvers ).


There are also over 50 references in the file system to VMware and vmx, and over 300 references in the registry to VMware.

while the areas to choose from for the attacker to detect a commodity VMM are plentiful, there are few malware making use of such fingerprints to detect VMM because these fingerprints can be hidden by employing various techniques borrowed from stealth malware technologies.


This is particularly helpful for security analysts either for taking proactive measures or for forensic or root cause analysis.

manual inspection of security logs is a time consuming and error-prone process, especially for mining large-scale attacks or stealthy activities.


Incomplete policy is not at all considered in either of the two.

whyNot [6] only considers the problem of identifying missing information in an access policy.


The performance of the ComDroid service is somewhat similar to both the Kaspersky and VirusChief services (Section 4.3).

the linear trend is much less prominent.


The mail client policyis similar when using the POP or IMAP protocol.

when mail is delivered locally, the mail INBOX folder must be write shared to enable sharing with the mail transfer agent (e.g., postfix)IFS and all mail folders must be write shared when using a mail delivery agent (e.g, procmail).


The advantage of this solution is that no extra work is required from users.

this approach does not work well with the second category of applications.


To re-instantiate a key after compromise, there is an unavailability period (COP_UNLINKED as speci.ed in the certi.cate) in case the domain lost access to its private key.

if the domain owner still has access to the private key, it can obtain trusted CA signatures for its new key, sign it with its old key, and immediately obtain an ILS con.rmation that will enable use of the new key.


It is surprising that, despite its simplicity, the combination of short authentication string protocols and color-coded binary comparison tasks has, to the best of our knowledge, not been suggested elsewhere.

in their comparative studyofWi-Fi Protected Setup and Bluetooth SimplePairing, Kuo et al.


E.ectively, he must consider which permission could compromise which data.

if the user does not accept the demanded permissions the application will not be installed.


If a setting is configured that is not supported on a Mac, it will be ignored.

administrators should be clear on what settings are not supported on the Macintosh so there are no surprises during deployment.


At the same time, because more concurrent users means more cycles needed to process their requests, the channel bit rates also slowly decreases.

compared to the original bit rate 85.86bps without third-party workload, the biggest drop in bit rate is no more than 6%.


Encrypted content EKT (C) can be freely exchanged between devices.

before transferring the associated Rights Object R between devices in the same domain, R and the encrypted content-encryption key EKD (KT ) are encrypted using the destination device public key.


Moreover, the experiments indicate that the SATbased procedure scales better than the DPLL-based procedures when optimal solutions are sought, whereas the DPLLbased procedures scale better than the SAT-based procedure when an exact solution is wanted.

the experiments indicate that the time needed to solve the UAQ problem is in the order of seconds even for relatively simple problems.


As we known, the page tables (PTs) in the OS are utilized by the hardware MMU to translate the linear addresses (LA) used by programs to the machine address (MA) used by CPU.

when the hardware-virtualization feature such as AMD-SVM is turned on, the PTs in the OS can only translate the LAs to the guest physical addresses (GPAs).


The quali.er inference sub-engine is also supposed to add additional type promotions for untrusted inputs, where sanitization primitives will eventually be placed.

the quali.er inference sub-engine does not apriori know where all sanitizations will be needed.


In principle, these approaches are more ef.cient, since the application code only runs once.

in practice, they have not been able to deliver the expected performance gains, due to inef.ciently collecting information from the application and the high overhead of communicating it to the analysis thread.


Using IFC entails meaningful tag creation, label construction as tag combinations and assignment to data, and software components being given the corresponding authorisation over addition and removal of tags from labels.

typically this has been in the context of personal data collected via web applications or other business processes.


So, the number of features keeps minimal.

with the minimal number of features, false positives increase.


All the above schemes would assign keys that never expire and new keys are generated only after inserting or deleting classes in the hierarchy.

in practice, it is likely that a user may be assigned to a certain class for only a certain period of time.


Third, again for ef.ciency, interrupts are checked and served only at the block boundary.

on real hardware, interrupts may happen on any instruction.


Upon receiving an integrity measurement request, HyperSentry needs to access the hypervisor s code, data, and CPU state to carry out the measurement process.

the SMM does not provide all the contextual information required by integrity measurement (e.g., the hypervisor s CPU state, which is not entirely retrievable in the SMM).


However, it needs to be adjusted according to the user s height and current position, which may lead to user s awareness.

the observable responses for the same password element are uniformly randomized.


s use of stack of a pushdown automata [17, 23].

a pushdown system implicitly depends upon the the transfer of control semantics of call and return instructions, and thus may not be generalizable to programs with arbirtrary stack operations.


Further work on borrowing detailed mechanisms from biology are likely to lead to similarly .awed defense mechanisms.

consider the relative success of the higherlevel ideas: the .eld of program-level intrusion detection remains quite active, and program randomization mechanisms are now part of mainstream operating systems.


Note that the legacy host may refuse to invoke an isolated environment or deny it some services, thus threatening its availability.

these attacks are easily detectable by SICE and its remote users (e.g., from the lack of response of the isolated workload), and can then be thwarted by replacing the faulty legacy host.


Nevertheless, it would be useful to experimentally verify this.

a direct veri.cation is not feasible since the system call monitors available today (or those that are likely to be available in the future) are weaker than the most powerful IOMs.


As a popular web application, Twitter has become a unique platform for information sharing with a large user base.

its popularity and very open nature have made Twitter a very tempting target for exploitation by automated programs, i.e., bots.


Our current approach provides explanations over shareability; it also suggests information transforms that modify/delete information attributes (e.g., participants in a meeting) in order to downgrade information.

it does not support automated downgrade using more sophisticated functional transforms such as (e.g., decreasing image resolution, statistical aggregators, etc), disinformation (e.g., false information intended to misguide the recipient), etc.


[25], and subsequently added as a feature in EC2.

the signi.cant cost of dedicated instances makesitimpracticalfor a variety of settings.


E.g., the Flicker authors describe in [18] how a PAL is used in the context of SSH password authentication.

the sealing operation binds the state only to the PAL (and to the device), but not to the application the PAL belongs to.


They consider risk coming from components such as the user, object, operations, connection used and the trust provenance of the attribute certi.cates.

they do not include the obligations as part of the risk components.


This causes a dilemma, since accommodating for even a single 2048-bit secret key in the state adds in the order of 1kB to the memory consumption.

if we do not allow for the generation of 2048-bit TPM storage keys, the only allowed seals are such that are done with the (symmetric) SRK itself.


Note that each credential represents Vi s authorized identity.

no one except TA can reveal Vi s real identity based on the credential.


Network engineers have implemented quick fixes such as Blacklists that keep track of infected computers, denying access until properly patched and cleaned.

this is a labor-intensive temporary solution that requires user involvement, not a fully functional system that automates all the necessary security updates and antivirus software installations as well as assuring proper firewall configuration.


[31] propose anapproachtomapNLpolicy statements to an equivalent computational format suitable for furtherprocessingby apolicy workbench.

neither of these approaches can identify sentences describing a policy rule.


The Web enjoys a performance boost thanks to its stateless nature, i.e., the system underneath web applications avoids the responsibility of maintaining states, and thus improves performance.

in the words of Robert Heinlein, There Ain t No Such Thing as a Free Lunch; now, we know how we pay for this: security.


Successful protection of information by an e.ective access control mechanism is a basic requirement for interoperation among heterogeneous data sources.

most existing work on access control focuses on access control model and security related information, little e.ort is devoted to exploring access control on the semantic-related heterogeneous databases.


In contrast to Saint, the user gets control over the granted permissions instead of the application developer.

the permissions de.ned in Saint and Apex only allow access to complete resources and remain applicationcentric.


WEAK ACCOUNTABILITY In the previous section, we presented a polynomial time algorithm for the strong accountability problem.

for the weak accountability problem instantiated with miniARBAC, we present the following theorem.


Recently, several cryptographic credential schemes and associated protocols have been developed to address these and other problems.

they can be used only as fragments of an ATN process.


There are relaxed notions ofCCA2 security[3,16, 52], but they do not apply to a fully homomorphic scheme.

constructing a CCA1-secure fully homomorphic encryption scheme is an interesting open problem.


Towards this goal, we take a data-driven approach using service logs that are readily available to all service providers.

simple historybased anomaly detection methods often fail to di.erentiate real attacks from normal behavior changes accurately (results in §4.2).


Chase [5] gave a multi-authority ABE scheme using the concepts of a trusted central authority (CA) and global identi.ers (GID).

the CA in that construction has the power to decrypt every ciphertext, which seems somehow contradictory to the original goal of distributing control over many potentially untrusted authorities.


Several researchers have developed special (non-standard) Java runtime systems capable of controlling resource consumption of tasks.

mobile agent systems have to be deployed in large- scale heterogeneous environments and they must support many dif- ferent hardware platforms and operating systems.


This capability might be useful, since analysts do not want to manually select the chart type if this decision is obvious.

the analysts do not want to be restricted to speci.c, pre-de.ned visualizations.


This is quite clear here that as the time increases our hooks will be increasing unbounded which leads to an unfeasible solution to report these hooks to the remote party.

the unique hook will stop increasing when it completes the combination of possible hooks generated, no repeated window will be measured and reported to the remote platform.


Observing that spammers and non-spammers usually form di.erent communities in the user graph, SD2 applies community detection based sybil defense algorithm to the user graph and achieves better spam detection performance than existing schemes.

because the e.ectiveness of sybil defense is sub ject to the spam attack intensity, SD2 does not perform well when the level of attacks increases.


Secure Box can be used to segregate corporate services and data from the personal data in order to be only accessible via intrinsic user authentication.

personal data could be accessible in the traditional way.


Denial of Service 1.4. is generally applicable to most systems but provides no possibility for identity theft.

it will prevent users from authenticating at relaying parties while the DoS lasts.


It solves the key escrow problem and the certi.cate management problem.

the existing scheme is not suitable for Advanced Metering Infrastructure (AMI) networks because of the utilization of expensive pairing operations.


The standard also describes requirements for wireless access tokens: The transmission of the opening code must be encrypted.

no keylength or other details of the used encryption scheme are speci.ed.


[5] assume that the data source M is discrete for the de.nition of fuzzy extractor.

the class of template protection schemes that uses continuous sources does not .t this model.


Our solution does not hide the exchange of communication between two parties, thus leaving such transactional data open to law enforcement agencies.

an attacker who does not have access to the users secret keys cannot detect the exchange of con.dential communication.


For instance, few people are going to wish to prevent people from knowing that they have graduated from high school, but many would consider their lack of a high school graduation attribute to be sensitive.

we argue that no system can adequately handle such a case because those who do have the attribute would likely be unwilling to accept any system which would result in them having to not disclose the attribute when it was useful for them to do so.


One may think that because many web services are transitioning to HTTPS, most recorded web tra.c is going to be encrypted, and both the ReSurf-based RCI approach and ClickMiner will become less useful in the near future.

it is important to notice that many modern enterprise networks already deploy web proxies that allow for SSL man-in-the-middle [7] (SSL-MITM) to enable the inspection of all HTTPS tra.c (e.g., to enforce tra.c .ltering policies).


While Swift only applies to JavaScript output by the Swift compiler, BFlow s reference monitor applies to all JavaScript code, such as legacy and hand-written libraries.

bFlow does make trade-offs; .rstly, it has coarser-grained security compartments (browser zones) while Swift tracks information .ow per variable.


Effectively, the usage of NH with the Merkle tree structure yields an e.cient integrity protection scheme.

as we mentioned earlier the universal hash function is not secure.


Due to this variety, it is hard to identify a method that is e.cient for concurrently detecting all of these di.erent components of a RegEx.

in most cases today, these heterogeneous components are detected by a state machine that consists of homogeneous states.


XACML is a very rich and .exible language; users and security administrators can directly represent in XACML a large variety of AC policies.

xACML has not been built to manage security in large distributed systems in which virtual enterprises are dynamically built with the collaboration of multiple independent sub jects sharing their resources (or services) to provide new (or better) services to customers.


This can support .ner granularity of data protection and would prevent any non-sensitive information from a private repository to be falsely tagged as sensitive.

in our current implementation, we assumed that the external repository does not provide such a classi.cation of the data it sends to the device.


The .rst part of the protocol is similar to the previous one: The procedure is started by the user requiring installation of a new compartment, then user request is transferred to the TVD Proxy, and TVD Proxy tunnels the request to TVD Master via the trusted channel.

the second part of the protocol is di.erent: The TVD Master does not transfer new compartment data to  Figure 5: System Installation: OKL4 Image built by TVD Proxy Figure 6: System Installation: OKL4 Image built by TVD Master the TVD Proxy, but builds the new OKL4 image itself.


Now if the password the user has submitted was correct, the decryption of E will still yield 1.

if it was incorrect, it will be a truly random element of G. Finally, to address (3), S1 and S2 must prove to each other, at every step, that the messages they are sending to each other are computed correctly.


A Closer Look at Recognition-based Graphical Passwords on Mobile Devices Paul DunphyNewcastle University Andreas P. Heiner Nokia Research Center N. Asokan Nokia Research Center Newcastle upon-Tyne, UK p.m.dunphy@ncl.ac.uk Helsinki, Finlandandreas.heiner@nokia.com Helsinki, Finlandn.asokan@nokia.com ABSTRACT Graphical password systems based on the recognition of photographs are candidates to alleviate current over-reliance on alphanumeric passwords and PINs.

despite being based on a simple concept and user evaluations consistently reporting impressive memory retention only one commercial example exists and overall take-up is low.


Since all JCS containers start in pristine state, system calls on those files can be safely ignored before the applications communates with other VEs or the outside world.

it is sometimes difficult to define or capture the exact point when an application transits from the startup process to normal opeartion phase.


3.2 Using General-Purpose Systems To reduce the asymptotic complexity of the strawman approach above, one can use a general-purpose system for VC/SNARKs [30] to veri.ably execute BFS which we did in Section 5 (assume unitweight graphs for the purpose of this section).

most existing systems implementing VC require the computation (in our case, the BFS algorithm) to be expressed as a circuit.


The nonces are generated by the dongle using a proprietary algorithm that utilizes an inbuilt clock and a fixed pseudorandom seed.

the nonces used in EKO s system are all pre-generated in bulk by Verisign and distributed in the form of paper codebooks.


K(K - 1) N = (7) 2 There are various approaches to aggregate classi.cation decisions of binary classi.ers.

we have used simple majority voting, where each binary classi.er votes for the predicted class.


From the results, we can conclude that the Gaussian distributed random matrix approach outperformed the other methods with generally higher values for each observed performance metric.

we cannot simply discount the sparse matrix and LLR random set randomized projection methods as unpromising or useless.


Given two policies, the policy similarity determines which policy is the most restrictive.

the policy integration preferences is an XACML extension by which a party can specify the approach to be taken if their policies have to be integrated with others.


Incidentally, Inter net access through http is one of the major security concern of any enterprise.

the hidden access paths under any other services can be formally modeled through similar approach.


SAML is in particular aimed at web-services and defines a mapping to SOAP messages exchanged via HTTP [13].

as stated in [13], although SAML introduces the concept of exchanging assertions, it does not define any new approaches towards authentication or authorisation.


The length of the string is too short for robust automated language detection.

we can, based on the presence of operator-speci.c (e.g., com.vzw.hss.myverizon, My Verizon Mobile ) and currency-speci.c (e.g., com.fdj.euro, Euro Millions ) package names, estimate the number of infected devices in certain regions like the US, Europe, and Japan.


It is then easy to see that there are doubly exponentially many maximal Q2-adversary structures on n players.

there are only exponentially many different protocols that can be specified by a number of bits polynomial in n. Thus, if the result was false, there would exist some protocol that could handle several different access structures.


Activation Access checks Intra-session Number Number of roles Nature  Number of permissions  Nature of roles  Nature of permissions  Inter-session Number of sessions  Arrival rate  Table2: Sessionpro.lecategoriesinourbenchmark.

this is not the only encoding as a permission that is meaningful; see,forexample,thework ofCrampton[26].)


5.2 Enforcement agent The enforcement agent is located in the end user s device, and thus at first sight does not seem to have any implications for personal privacy.

as the component that enforces license conditions, the enforcement agent has critical issues that have to be addressed concerning the user s privacy.


In a strong economy, schools might have sufficient funds to provide needed professional development opportunities to their technical staff.

in a down economy, funding to professional development is cut; unfortunately new threats and vulnerabilities to IT security do not recede simultaneously.


Such systems have the ability to make access control decisions based upon the state of the world.

for instance, one could use constraint datalog to grant access based on user clearance levels and document classi.cation levels as follows: grant(U, D) :-user(U), document(D), clearance(U, L1), level(D, L2), L1 = L2 such systems use rigid and opaque classi.cation of documents to drive access control decision (e.g., clearance and level in the example above).


Drawing from this knowledge, we strive to improve the security of the scheme: by systematically changing the pattern layout in such a way that these typical strategies are thwarted, we encourage users to chose patterns in a more diverse way.

we concentrate on small modi.cations that allow us to keep the overall design of the patterns to foster the roll-out of a potentially better graphical password scheme.


However, it does not allow the users to perform a task as long as the union of all the actions, that have been permitted to the common users, cover all the actions that are necessary to complete the task.

the dynamic separation of duty [10] allows users to use more than one role but disallows their requests to perform the roles at the same time.


The Shimmer nodes are docked over UART interface to program.

the RPi is connected with eHealth sensor shield as shown in Figure 3b through Connection Bridge.


All approaches have in common that they consider only RBAC models or simple extensions thereof.

we used a uniform framework for security policies that is expressive enough to model sophisticated real-world policies such as the ones of NPfIT.


The verifer can anonymously verify the signature's validity.

there is a question of how to anonymously send the group signature to the verifer.


There exists literature about how to reliably disassemble and rewrite code when no relocation information is available [33].

these solutions su.er from signi.cant space problems, and cannot accurately determine indirect jump targets.


Only in the event of a revocation, the cache gets reset and the system will need to re-insert the new security decisions into the cache.

the alternative of downloading entirepolicy modulesinstead of cacheinsertion,will result in much greater overhead.


4.1 Extended Dynamic Taint Analysis The dynamic taint analysis in Argos resembles that of other projects.


Hence, an effective and ef.cient support of constraints for RE is worth investigation.

the research literature on constraint in access control has focused mainly on checking if there exists a con.guration consistent with constraints or if a change to a con.guration is safe with respect to constraints.


Existing computer applications typically are not SRAs.

sRAs could be advantageous in a wide variety of domains.


Powerful feasibility results have been shown for this problem, demonstrating that any two-party probabilistic polynomial-time functionality can be securely computed [5, 2].

these feasibility results relate only to the stand- alone setting, where a single pair of parties run a single exe- cution.


The credential selection algorithm is executed multiple times, once for each credential type threshold satisfaction.

their credential selection approach for policy compliance does not consider policies with .exible threshold on individual credential types which are considered in this paper (see Figure 1).


This approach may obviate the need for a revocation mechanism.

it has the disadvantage of increasing the TA s workload, since the TA is required to regularly generate private keys and deliver them to users.


It is noted that communicating channels between the host and the device must be protected as the self-issued IdP in the terminal accesses directly to the credential storage component running on the trusted device.

to gain better performance, we can rely on the security of the transport protocol being used in Is as long as it is secure enough.


¬rrepj .t2 = T2), .. j=1 (12) Moreover, the thresholds dx are learnt from the model built using the benign logs collected under normal condition i.e., without any attack.

they can also be manually con.gured based on the requirements of the network under consideration.


Based on the previous descriptions and properties there are now several questions we would like to be able to ask and later formally specify for automated verification by the model checker.

we explicitly exclude workflow analysis related questions (e.g.


This gives us a key for the access structure (T AND T ' ).

since T ' is more restrictive than T , this access structure is equivalent to T ' itself.


Au is required to perform distG(u,v) + 1 decryptions, where distG(u,v) denotes the length of the shortest path between u and v in G.The EBC supports insertions, but not deletions, of classes and edges in the hierarchy without re-distributing private information to the classes a.ected by such changes.

in [11] a simple modi.cation of the scheme which avoids such a redistribution has been proposed.


Simulators are designed to be able to create any realistic suite of GPS signals, and can therefore be programmed to create signals consistent with what a receiver would see at any speci.c place on the planet.

they are designed to be connected directly to a receiver for testing purposes.


Modern processors from AMD and Intel provide a non-executable bit for each memory page, which operating systems can set for data pages.

in return-oriented programming (ROP) attacks [5, 31, 32], the attacker overwrites the stack with addresses that point to already existing code.


Protecting against dictionary attacks in this restricted setting seems impossible at .rst glance.

in 2006, Canetti, Halevi, and Steiner proposed a scheme that makes use of POSHes to accomplish these goals [3].


DISCUSSION The experiments presented in Sections 4 and 5 suggest that network address space randomization is likely to be useful.

these results should only be treated as preliminary, as there are several issues that need to be examined more closely before reaching any de.nite conclusions.


As example, the nova-compute service accepts .le paths from nova-api service specifying locations to upload data to an instance.

if the .le path is not validated by the nova-compute service, it can cause a directory traversal attack [20, 21, 22] and permit the nova-api service to overwrite arbitrary .les on the compute node.


The bigger the neighbourhood is, the better the scheme resists such attacks.

although the establishment of such contextual dependence is essential for countering vector quan-tization and transplantation attack, the accuracy of tampering localization is reduced inversely proportional to the size of the dependence neighbourhood.


We classi.ed these cases as VOIDPOINTER.

this behavior was only found when analyzing rootkit drivers.


Because the first curve does not renew its key pair, its security strength monotonically decreases.

the other curves do renew their keys, and thus can maintain a minimum level of security.


They use virtual machines and a type 1 VMM to isolate the compartments and to provide a trusted path to Vault.

they do not address classical phishing directly because users have to enter passwords into Vault at each login and verify the legitimacy of web sites on their own.


For larger worms such as MSBlaster, it will take a lot longer without.

the trial-anderror search algorithm for a can be greatly improved using heuristics and parallelism.


If we use standard µTESLA with one key per day, it would take one day to authenticate the message, since the receivers would need to wait for the disclosed key one day later.

if we use many keys, for example, one key per second, it would require 86,400 keys per day (not using the optimization we presented in the previous section), and a sensor node would require an expected time of 43 seconds to verify the authenticity of the key.


We observe that the eavesdroppers are not able to replicate the channel measurements accurately, con.rming that the base and mobile can use the RSSI measurements to generate random keys.

we .nd that there are discrepancies between the signal strengths measured by the base and mobile.


MH PKC has a remarkable feature that the encryption and the decryption can be performed very fast.

it is known that MH PKC can be broken with the attacks of Shamir [3] and Adleman [4] because the public key is made from a superincreasing sequence with the modular multiplication.


Thus, the originator of the query is at best k-anonymous.

as the adversary knows the users exact location they have no location privacy.


In the case of Android, we use package names as 15https://support.google.com/googleplay/android developer/contact/publishing  identi.ers.

linux .le system paths could also be used, resulting in an improvement over the key-locking proposal of van Oorschot and Wurster [24].


Out-of-order packets: A common way to process out-of-order packets is to use a large reassembling buffer for each flow.

for a network link with massive concurrent flows, the amount of memory to reassemble packets is a great challenge to the limited memory resources.


[3] present a tool, called StowAway, that can extrapolate the needed permissions of an application from the application binary.

both tools currently cannot extract required permissions accurately for reasons we discuss in Section 3.3.


This is required knowledge for the monitor in the case of system call number randomization as the monitor must swap out the randomized system call number with the proper number as the operating system kernel is variant-agnostic.

in cases like heap layout randomization or reverse stack growth, the monitor needs to know that the memory maps of the variants cannot be directly compared.


To have good access control, many excellent authentication mechanisms, e.g., password authentication [4, 15], ID-based authentication [9, 21], were developed.

since the limitations of these mechanisms, we still need a novel mechanism.


For Shot to be secure, only PE and PV should be able to send information on the vibration-to-accelerometer channel.

if an attacker were to send information on the channel, a user could detect the vibrations and abort the exchange.


As exempli.ed in the introduction, there are several use cases where the sender is trustful and has no incentive to cheat.

while it may be useful to keep the identity of the receiver private, it may also be useful to have some means to discover the identity of a receiver in case of misuse or dispute.


The Adage project [19], the successor of MAP project [18], may be the largest effort to date to employ usability design techniques in developing an authorization service for distributed application.

mAP and Adage were intended for use by professional system administrators who already possess a high level of expertise, and as such they did not address the problems posed in making security effectively usable for a more general population of end-users.


In the setting without BC channel and for .> 0, our results match those of [15] (which they prove optimal for this case).


4.2 Loading Arbitrary Dalvik Classes into anExisting Process The ability to redirect any existing Dalvik method and map it to an arbitrary native call is useful and powerful in terms of dynamic instrumentation.

our instrumentation approach also allows us to load additional, arbitrary Dalvik classes into an existing process.


2.2 Shortcomings of URA97 and PRA97 The ARBAC97 model supports simple and decentralized security administration.

from a practicality viewpoint, it has some significant shortcomings.


Mohan S. Kankanhalli School of Computing National University of Singapore, Singapore mohan@comp.nus.edu.sg  the presence and actions of people for various purposes [8].

the widespread use of video surveillance has raised concerns about the privacy of people.


Authentication, access control, and other security issues are handled by the OS giving the appearance of reliability.

a close examination uncovers a major flaw.


Firstly, the servers could keep a store of all possible identi.ers and corresponding hashes; but this could be a lot of data to store and thus be impractical.

there should be a few root servers that could handle such storage in case of failures of original servers.


This factor also a.ected the decision of where to install the IDS, as they believed that it would be much easier to install the IDS in a small network domain.

it seemed that the only way to know how the complexity varied was to complete the full installation process on each of the candidate networks.


For example, one can .nd that both the NFA and the DFA for the pattern set of  and  have 13 states.

the NFA for the pattern set of  and  also has 13 states, but corresponding D-FA has 33 states (see Figure 1a).


The middleware can be passed a number of options to control its execution.

all options have default values allowing the instructor to simply execute the middleware, maximizing ease of use.


Most of the policy-level queries implemented by the advisor correspond to attacks uncovered during formal analyses of sample policies.

the table that summarizes the integrity and con.dentiality guarantees of a policy corresponds to authenticity and secrecy theorems proved by the veri.cation tool: if any header is both present and signed according to the table then, in the model, it is authenticated between client and server.


This is technically possible with the access to source code.

advanced control-.ow features in C++ make the building of a CFG dif.cult.


4.6 Policy of Data Retention and Account Deletion Foursquare speci.es that when a user deletes an information submitted, this information is withdrawn from the service.

foursquare also states that this data might still appear on backup logs for a reasonable amount of time (whose duration is not de.ned) or in possession of users who have already browsed through and downloaded the submissions of the users.


We came to the conclusion that the speci.cation of trustworthiness requirements from an SR platform using XACML allows an SP to specify its expectations in a concrete policy.

an XACML behavior policy can combine di.erent attestation models of WS-Attestation.


In the method of Wang et al., Special Counting Rules 2 takes account of the property of the function f in 3rd round, and reduces the #CVCs in a special case.

there are many other such properties for f, and then, their counting rules don t cover all the properties of f .


We also review other related existing schemes ([3],[6]) and found that they have certain limitations.

we found an e.ciency issue in Wang et al.


factors are closely around 1 or a constant number.

if where T ismalicious cutting or inserting occurs, the dubious audio s time structure will be changed and show a concavo or convex in the a malicious operations, and set as 0.35 in experiment.


It also does not consider DMA attacks that directly use malicious hardware devices to subvert the kernel memory.

the attacks discussed in this paper are most common, an also most di.cult to defense against.


Instead, using a powerful dedicated central node to compute clusters/super-traces and distribute them to Glove proxies (e.g., via Tor bridges  since the security of Glove is independent of the secrecy of the computed super-traces) is more e.cient.

such a node may not be easily available in the real world.


Focusing on avoiding XSS, the library declares the web server as a sensitive sink.

we believe that there are other sensitive sinks in GAE.


Since the size of code is small compared to the addressspace size, this optimization makes the bitmap compact.

the code-address-only bitmap seems to require bounds checks.


Intuitively, allowing a recommender to return more recipients each time will reduce the average data leakage, because a user is more likely to .nd the desired recipients in the recommendation list.

in reality, a longer recommendation list will take the user more time to examine, which reduces ef.ciency.


It is a protection domain in that each process has its own address space and privileges are associated with process IDs.

a process is also an execution unit in that each process runs as a separate entity.bundling protection domains withexecution units is unnecessary in situations where an application desires only a new protection domain for isolating sensitive code; creating an extra process would force the application to create an execution unit as a by-product.


Since a depth one ring is challenging for economic reasons and a depth three ring does not provide containment, clearly a depth two ring is the only workable option for a deployment in a ring around China.

the depth two ring around China is 3,806 ASes large far too large to see a successful deployment.


Random Dots Participant performance was no worse than baseline with up to 2,000 random 1 pixel dots.

for every additional 1,000 dots after that, accuracy declined about 6% and solving time increased by 0.7s.


While VMST also faces kernel kernel this issue, it is less severe as many of these primitives are accessed in interrupt handlers.

in E X TE RIOR, we have to investigate this problem further as some memory write operations do involve synchronization primitives (e.g., when removing a kernel module, delete_module syscall needs to lock the module list.


Relief can be found in the fact that a jammer using EM would considerably deteriorate its own lifetime advantage because EM is a computationally expensive, and hence energy-consuming algorithm that involves multiple exponentiations.

a duty cycle of 50% may not be energy-e.cient enough for most WSNs that are characterized by low data rate [29].


Secure Streaming Forensic Data Transmission for Trusted Anyi Liu Department of Computer Science Indiana University Purdue University Fort Wayne 2101 E. Coliseum Blvd., Fort Wayne, Indianan 46805 liua@ipfw.edu  Cloud Jigang Liu Department of Information and Computer Sciences Metropolitan State University 700E 7th St., St. Paul, MN 55106 jigang.liu@metrostate.edu ABSTRACT The proliferation of cloud computing requires excessive forensic data to be acquired, transmitted, and analyzed in a timely manner.

current digital forensic technology is ill-suited to cloud as it exposes the problems of trusted data acquisition and secure data transmission.


This signi.cantly improved the traditional one-by-one detection approaches in the literature.

the traceability of the traitor detection scheme has a up limit that is constrained by the number of variations q one can build into the content.


On the one hand a user is enabled to perform his everyday tasks in a energy e.cient way, while being isolated from the rest of the system.

corporate policies can be enforced by the management domain.


of Computer Science, UCLA, 4732 Boelter Hall, Los Angeles, CA 90025 1 IBM T.J. Watson Research, 19 Skyline Drive, Hawthorne, NY 10532 2 {chengje,hywong1,slu}@cs.ucla.edu1, haoyang@us.ibm.com2 ABSTRACT Smartphones have recently become increasingly popular because they provide all-in-one convenience by integrating traditional mobile phones with handheld computing devices.

the .exibility of running third-party softwares also leaves the smartphones open to malicious viruses.


Capability systems using sparse capabilities solve this naturally.

if capabilities are exposed to the user, it raises a usability concern: annotating a capability and handing it to the delegatee are separate steps.


Therefore, the throughputs reported are not what a NIDS/NIPS achieves when monitoring a network link online.

if the core engine is fast, a well-engineered NIDS/NIPS can achieve high throughput, without vulnerability signature matching being the bottleneck.


The comparative study includes several important middleware features and gave an insight into the strengths and weaknesses of each middleware architecture.

further details of each architecture, such as privacy, security and the use of agents, may not be assessed by this study.


7.2 Countermeasures Although various traf.c watermarks have been designed, onlya few approaches have been proposedto detectthem.PNR [11],a pioneeringwork from Peng etal., employs in.ated one-way packet delays to detectthe traf.c watermarks proposedin[1] and estimates its parameters.

pNR adds a timestamptoeach packet and has tohandle the synchronization issues.


Choosing the proper key management scheme for different ZigBee networks may become application specific.

there are a few best practices that should be followed with whichever key management scheme is chosen.


The economics of cloud computing allow both portal operators and merchants to bene.t by moving their applications into the cloud.

although cloud platforms o.er services for exchanging data between virtual nodes belonging to the same cloud user, there is little existing support for secure query execution between di.erent cloud users.


This is similar to the VAX/VMS notion of privileges introduced back in the late 1970s [24].

while privileges in VAX/VMS are typ ically granted to a user of the system, in modern platform security architectures, they are granted to software modules.


The part of the query concerning sequences of events corresponds most closely to the NPATRL events.

these events only correspond to user actions, and do not include learn events, which correspond to intruder actions.


The adversary might use a computer program to try to solve some of the GOTCHAs to save cost by not querying a human.

in this case the adversary might fail to crack the password because the GOTCHA solver found the wrong solution to one of the challenges.


7 are nearly equal to the ideal value of 50%.

the average inter-chip HDs for the bitstrings of length 5,662,020, i.e., those with the weak bits included (not shown), is 48.4% and 48.5% for TGVD and TCD, resp., so removing the weak bits improves the inter-chip HDs.


The most effective signatures in ClamAV matched parts of the decoding routines, methods used in common exploits, and code used to perform heap spraying.

these signatures would be easily evadable, for example, by introducing simple syntactic modi.cations to the code.


We argue that permissions required by web apps should also be treated in a similar fashion.

we note that the set of permissions for web apps falling under the normal and dangerous categories would differ from the ones de.ned in the Android framework and not all of the permissions for native apps on Android would be relevant to web apps.


We have demonstrated the effectiveness of our approach using a spectrum of experimental evaluations on both synthetic and real world data.

in social networks, the node data (user pro.les) as well as edge labeling often reveals additional sensitive information.


Table 2: Performance Evaluation of DS No.

of Policies Load Time Evaluation Time (w/o cache) Evaluation Time(with cache) 10 5ms 48ms 38ms 100 15ms 64ms 46ms 1000 29ms 88ms 64ms  the time taken by the DS for xDAuth policy loading and evaluation is heavily dependent on the number of policies.


A secret value is used as encryption key which must not be exposed as public.

the key can be extracted by adversary using white box attack.


Overall, the worst-case computational complexity in our framework is quadratic.

in practice the complexity is reduced because users generally interact with subgraphs of the attack graph at any given time, and at lower levels of aggregation subgraphs of negligible size are being processed.


Due to the less stringent security features in comparison to Windows 7, we chose to use Windows XP SP2 32-bit as the operating system for the virtual machines.

especially for some games, it was required to install Windows 7 instead.


The normal intent is delivered to every receiver simultaneously.

the ordered intent is delivered to one receiver at a time.


Signing: Message m, compute r = m· gk mod p, ´r = r mod q, s = -k - r · x mod q, and output (r, s).

verification Verify s < q, compute r_ = r mod q, and check that gs · yr · r = m .it is advised to apply some redundant function R to a message m and use R(m) instead of m[4].


Despite the aforementioned solutions, which offer some kind of protection, little has been published regarding the identification of hidden data stemming from email.

there are many steganography tools available as freeware online, that any employee could conceal information to other files, bypassing all the policies.


These systems ful.l the special requirements in this .eld.

our approach is more general and meets the needs of most commercial enterprises.


HookSafe [45] further extends it to enable a scalable but lightweight kernel hook protection.

as pointed out earlier, these approaches are still vulnerable to return-oriented attacks where malicious computations are performed by leveraging existing return 1 We notice that the segmentation-based support may not be available in 64-bit architectures.


In this PUF, the ring oscillators are designed to be identical.

as a result of the manufacturing process, the wire length and width will inevitably di.er.


This paper is similar to ours in that it deals with the interplay between high level properties and lowlevel policies and deals with both static and runtime analysis.

it is limited to analyzing the assignment of users to roles, and so only deals with enforcement on an access control policyand statelevel,but not on an actionexecutionlevel.


Due to space limitation, we defer complete discussion of this part tothefull version of thepaper.


Concerning inner edges, doubly incident to the outer face, their number is m-1, hence their contribution to the boundary size is at most 2(m-1).

the contribution of dummy faces is maximum when a dummy face is produced by a true stem immediately preceded by a false stem: as there are m+ 2 stems, there may be at most p m+2 ldummy faces, each contributing for 2 4 edges.


In both top-down and bottom-up approaches, obtaining di.erent views of the network requires a user to perform interactions that manipulate and navigate within these visualization environments.

in many network security visualization tools, there could be hundreds of possible interaction combinations for a user to navigate [9].


Caching authorization responses is not a new idea in the domain of access control: it has been used to improve system e.ciency and reliability [3, 8, 13, 19, 28].

these and other approaches only compute precise authorizations and are therefore only e.ective for resolving repeated requests.


SUNDR could be used locally to provide private storage to isolated applications.

it is not designed to ensure freshness in such a setup and its untrusted block server is targeted at multi-disk storage solutions, which mobile devices for end users cannot o.er.


A calculator of the first class works under a policy that allows no data to leave the browser.

the second class needs to send data to its origin server, but still works under the strict SOP policy.


Signature/Rule-based NIDS [1, 18] matches the network tra.c against its signature set and o.ers good protection against previously known attacks.

with growing set of exploits and increasing wirespeeds, inspecting the network tra.c becomes a challenging task.


From this point onwards, the principle of booting is like in TPM where every component takes a measurement of the next component to be run.

in MTM the measurement can be further validated against a certi.cate a Reference Integrity Metric (RIM) before the measurement is extended into the Platform Con.guration Registers (PCRs).


The third-party cookie blocking option on modern web browsers allows users to block cookies if the top-level frame domain does not match the cookie origin.

as shown in Table 1, neither Internet Explorer 6.0 nor Mozilla Firefox 1.0.7 checks the top-level frame domain at both the time the cookie is set and the time it is read.


Figure 4(a) shows that the difference between RSVAMO and RSMV are relatively small, and .RS varies between -0.02 and 0.06.

the three remaining validity indexes (Figure 4(b) through Figure 4(d)) clearly show that VAMO s reference clustering agrees more closely with the underlying true clustering C, compared to the majority voting-based reference clustering.


We also acknowledge that our validations on some possible explanations proposed in this work may be not absolutely rigorous, due to the di.culties in thoroughly obtaining criminal accounts social actions or motivations.

we believe that our .rst-in-its-kind analysis of those phenomenon still provides great values and opens a new door to better understand the cyber criminal ecosystem on Twitter.


If a risk that is object of the dialog materializes, security is compromised.

often security breaches are not immediately apparent, or causal links between them and the user's dismissal of a security dialog are unclear.


Likely Scenario With enough effort and with the proper use of public key technology, the user is in a position to take charge of her own privacy.

tool development will probably be driven at least in part by the marketing and standards efforts of those who have a profit motive the commercial CAs.


Compared to ECC, CEILIDH has the same advantage of small key size and small cypher length.

it is about two times slower thanECC with equivalent security.


In KNN, there is no explicit training phase and it only stores features and class information.

the testing phase is costly (both in time and space) because an instance is classi.ed by a majority vote of its neighbors through computing Table 2: Network behavior analysis of malware families.


Access-key or Cipher-text tracing, Eavesdropping and Spoofing (Reading and recording the messages passed between tags and interrogators), and Man-in-the-Middle attack (Modifying the messages passed between tags and interrogators) -Tag output is indistinguishable from truly random values and un-linkable to EPC.

the tag output is not constant and also it does not expose any meaningful information.


This clearly demonstrates that exhaustively exploring event space is not scalable and practical.

symbolic execution cannot cover the critical events in WeChat in this con.guration, and failed to cover critical events in two cases(Youlu and WeChat ) if we lower the threshold to 10 events.


In order to guarantee transmission for all nodes during a time slot, the latin square dimension P (which decides the number of available channels) must at least be equal to the number of colors produced by the vertex-coloring step.

a graph G with maximum degree D needs at least D+1 colors to be distance-2 colored, and is upper bound by o(L2) [14].


Due to the edge removal, an additional e slots may now be free.

since i is expensive, more than 9e of its slots are free.


Inthispaper weproposethat the denial is depicted by the concepts of competences and empowerments.

the break-glass point need not be reliant only on a set of access control points.


Still, item-level RFID tagging is often considered to be 5 or more years in the future for retail RFID applications, due to the cost of tags, reader infrastructure, and uncertainty about near term applications.

library RFID applications require item-level tagging, because RFIDs are used to manage each item in a library collection.


This tool can also be used for a compliance check for the core XACML speci.cation and the extension introduced in this paper.

it is intended to support composing authorization policies for inter-domain collaborations only and not meant to replace administrative tools for internal local policies.


This implies that the attacker cannot falsely increase the Count.

the attacker may attempt to decrease the Count by dropping a genuine MAC (or by corrupting a genuine MAC) sent by a contributing node, but the genuine MAC is likely to reach BS via an alternate path.


In order to share resources, each user must know the local identities of users that he/she wishes to share with.

local identities are often inconsistent or transient, thus preventing any sort of sharing at all.


A special case of this problem, in which no bound on the Probe-Paths length exists, has been shown to be an instance of the NP-hard Minimum Set Cover problem [5].

covering all the network s edges is very likely to generate too much Probe tra.c and increase the learning dimensionality, thus making the learning task too complex.


without the need for any central authority.

these approaches usually assume that such networks can be pre-con.gured and that it is a priori known how big the network is, or how big it might get.


Assuming a secure hash function is used, an attacker cannot determine the value of the unreleased claim via cryptanalytic attack.

since most claims are likely to be in a standard form, a dictionary attack should often be successful.


Given knowledge of the target selection algorithm, the sequence of scans could be re-enacted to provide a detailed view of the worm s evolution, and also provide insights into characteristics of the infected hosts.

although the information required for this approach (i.e., the payload) can be recovered locally, the mechanism can not be easily generalized to other worms, since each instance will have to undergo the same, possibly arduous, task of reverse-engineering.


If the .rst sub-query does not allow it, then the user can leave a .ngerprint and still be allowed to override provided that at least it is known he is not denied.

theOlax querymaybe seen as too risky when the override involves sensitive resources.


In scenes 2 and 3, at first Jack appears to fall for the ploy in the emails, and he is seen about to open the attached file.

he realizes that the emails possess suspicious characteristics, verbalizes them, and rejects that risk.


The linker ignores and replaces all split-hardened data symbols, because they are superseded by the non-weakened split-base data symbols.

because of their distinct names, the split-hardened and split-base functions co-exist in the split object.


If the attacker can learn theTPM ownershippassword, shecan createnewAIKsand delete existing AIKs from the TPM.

new AIKs are not a threat unless the attacker can convince the user to add them to their PSD.


Other PCAs mentioned in this paper whose evaluation results do not depend on the order of sub-policies, such as permitoverride, strong-consensus, and weak-majority, can also be speci.ed using linear constraints.

the linear constraint approach cannot specify .rst-applicable , as the evaluation of linear constraints does not take the order of policies into account.


Speci.cally,itworksby arti.ciallygenerating exceptions and using the exception handling mechanisms (i.e., signal handling) to hide normal control .ow.

each exception used for obfuscationis standalone and.ow-insensitive,which makesthe level of obscuritydirectly rely on the number of exceptions.


Liakh, Grace, and Jiang [25] analyze the enforcement of the write exclusive-or execute regime for Linux kernel pages, and propose .xes for each violation.

on the 3.2.48 x86-64 vanilla Linux kernel we used, we were able to verify (by performing a page table dump) that writable and executable kernel pages remain.


The following trigger closely resembles the pre-condition constraint (1): s:activateManager for John .

enable Junior_Employee (assume John is the manager)  the only if semantics of the pre-condition constraint requires that there be no other events that will enable the Junior_Employee role, i.e., the Junior_Employee role is not enabled if John does not activate the Manager role.


The authors of Proxos claim that their private .le system comprises less than 2,000 lines of code.

this code still relies on a secure block device provided by the underlying virtualization layer in order to store the hash sums of the individual .les.


Note that this approach still works correctly since any of the returned IP addresses will direct the client to a valid CDN server, and DR-DNS ensures that one of those IP addresses is always returned.

dR-DNS heavily relies on the results of majority voting to improve the reliability.


The existing software has been modi.ed to .t our needs as described in the following section.

our implementation could as well be realised with proprietary software.


Furthermore, we .nd particularly interesting to compare our method withthe onesof(externalor internal)ear recognition.Infact,similar to our method, also these methods could be used for authenticating the user answering a phone call, without requiring a speci.c interaction for the authentication.

these methods have the drawbacks discussed before: theysuffer from in.uence of externalfactors (e.g.


e. On the Windows side, setting/ changing passwords in user records using LDAP protocol requires the use of 128 bit SSL connection [31].

as of this implementation, we have decided not to use this method for password setting/ changing.


Besides, the later work introduces a mode named Administrator Mode in which they make security policy by using user-level tool in guest OS, while in this mode guest OS is assumed to be secure.

our approach makes no assumption about the guest OS.


Ideally, a UID sharing mechanism would satisfy all 6 properties above as well as allow apps signed with di.erent keys to share a UID (property 7).

in the course of redesigning the mechanism, we found that in every case, adding property 7 precludes at least one other existing property.


If the user selects the probation mode, the application will be added to a list of monitored apps on the phone.

if the user selects the trusted mode, the application will be installed with all requested permissions granted.


By avoiding the use of the forking lemma, the GDL-and SJKEA-based security reduction of OAKE in Theorem 6.2 is as tight as the GDH-based security reduction of KEA, which is in turn much tighter than the GDH-based analysis of OAKE in Theorem 6.2.

the GDH-based security reduction of OAKE is still tighter than that of HMQV based on GDH and SKEA.


In this way, we can precisely label kernel modules and documented kernel objects.

for undocumented objects, we rely on their pool tags obtained from the ExAllocatePool-WithTag function call.


In this way denials by q are given higher priority than grants by p, so con.icts cannot arise.

one cannot symmetrically state that grants of q should take priority over denials of p. It should be possible to state absolute access rights as well as absolute prohibitions.


Approaches to information-.ow tracking can be split roughly into two categories: programming language-based techniques [13], which are generally .ne-grained and static, and techniques used in operating systems (e.g., [10, 4]), which are coarse-grained and dynamic.

both Breeze and the Safe hardware support dynamic enforcement of .ne-grained information .ow, as done in [2]: indeed, a low-level dynamic approach allows our platform to run programs that were not statically checked or compiled with our compiler.


However, note that as soon as the newly deployed nodes meet the previously deployed ones, the former ones will exchange tokens with the latter ones, so removing the initial undesired property.

if a single alone node is deployed, we should use some other mechanism; e.g.


In Section 4.2, we will show that the statistical power of our attack relies on the selection of the reference group.

even when the reference group does not completely mimic the genetic background of the case group, the attack still works, although with a lower power.


About two years prior to the participatory observation, the IDS had been installed by the security specialists in one particular network domain.

it soon crashed, possibly due to memory space issues (the IDS GUI did not provide practitioners with functionality to manage the IDS s use of the hard-disk partitions), and/or from additional tra.c from a newly-added wireless network.


The .rst certi.cateless key exchange protocol appears in the seminal paper by Al-Riyami and Paterson [2].

no formal security model or proof for this CLKE protocol is provided.


assumes that the malicious tag agrees to yield partial information about the secret key so as to aid the adversary, but not if the adversary can directly use the data for future authentication.

the attack is in itself somewhat impractical, or .awed, since (a) when the tag helps, the adversary s success probability is not overwhelming (just signi.cantly larger than guessing probability); (b) when the tag stops helping, the adversary has a lower probability to succeed than before, but not an insigni.cant one.


In the .eld of s.p.e.d., data encryption schemes are required to have the homomorphic property.

data encryption schemes are more preferred for practical SSP applications, if the following three properties are satis.ed.


Alternately, Alice could add all her .les to her working set via the Web interface.

it is to Alice s advantage to use WSBAC.


Some of the goals of this work is similar to ours, they are both geared to studying botnets.


Many NIDSs are able to normalize FTP commands by identifying and stripping out the control sequences used by SideStep.

by using alternate control sequences it is still possible to evade current NIDSs.


Their rewriting techniques typically target the assembly code yielded by a speci.c compiler with speci.c compiler options (e.g., [25, 39, 53, 58, 61]) or type-safe byte-code languages (e.g., [2, 6, 16]).

most static binary rewriters make strong assumptions about target binaries in order to successfully preserve their behavior.


3.2 Platform locking issues At .rst glance, mandating certain security con.gurations might seem like a practical solution to the whitelist management problems: the service provider would select a number of con.gurations that they consider trustworthy and force the users to use them to access their service.

mandating the use of proprietary security software can impose severe usability and compatibility penalties, and must be treated with caution.


Tracing Algorithm without Knowledge of the Subgroup containing traitors We will now present a tracing algorithm that doesn t necessarily need to locate the user group that contains all of the traitors.

we are still under the same assumption on the geometry of traitor locations: all of the traitors T are in the same user group Ul = {u2k·l+1,...,u2k·l+2k} for some l .


3.5 Pseudorandom Function That IC card has few random source causes problem when it uses probabilistic signature scheme since most of probabilistic signature schemes are known to be weak if the random tapes used for signing are revealed.

most of deterministic signatures such as RSA-FDH [5] and BLS signature [11] are ine.cient.


Pinkas and Sander proposed the use of CAPTCHAs to secure passwords against online dictionary attacks in [13], and variations of this scheme are now implemented all over the Web.

this scheme does not meet our needs because it only provides security against online dictionary attacks, with a trusted server.


The situation is further complicated in case of application layer protocols like HTTP, where each request is sent in a new connection and the connection terminatesassoon asaresponse is obtained by the client.

this User Interaction overhead can be greatly reduced with a few basic options which can be easily embedded into the UI-Manager.


LIMITATIONSOF EXISTINGWORK In the previous section, we described a number of existing MDA systems that appear to achieve reasonably low error rates.

we have identi.ed several recurring problems with respect to how these techniques have been experimentally evaluated.


[10], would make the protocol signi.cantly more expensive.

the simulator turns out to need to compute only values which include adversarial players randomness in the exponent, i.e.


Conventional X.509 digital certificates [2] provide all desirable characteristics except privacy since the individual s identity is explicitly included in plaintext on the certificate.

blind certificates [3, 4] (including limited show certificates) provide guaranteed privacy, but do not provide accountability, or an audit trail, and cannot be used in a regulatory reporting context since it is impossible to link a blind certificate to its owner after it has been signed.


Certainly, this is necessary for a complete understanding of the underlying mechanisms in modern encryption algorithms.

the vast majority of people developing or evaluating a cryptosystem will never create or crypto-analyze the underlying Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.


This allows for Turing-complete behavior in the target program without the need for injecting attack code, thus signi.cantly negating current code injection defense e.orts (e.g., W.X).

its inherent characteristics, such as the reliance on the stack and the consecutive execution of returnoriented gadgets, have prompted a variety of defenses to detect or prevent it from happening.


For example, Bill Gates has his veri.ed Twitter account at http://twitter.com/billgates.

in our dataset, only 1.8% of users have veri.ed accounts.


As we explain in Section 5, applications do not use many undocumented APIs, so the omissions of these APIs from Stowaway s mapping does not result in false detection of overdeclaration by Stowaway on real applications.

the inclusion of these undocumented APIs in PScout s mapping allows us to perform a more complete analysis of Android s permission map.


An ideal anomaly model which detects all attacks with zero false positives is the holy grail for an intrusion detection system, but in practice this is not achievable.

there are some good models for speci.c areas such as SPAM detection and network worm detection.


Formal de.nitions for Core P-RBAC and Hierarchical P-RBAC are given, con.icts between two P-RBAC permission assignments are discussed, and con.icts detection algorithms are presented.

there are a few interesting problems left open.


6 H1(rA,1, dkA,1)is not registered in LH1.

a does not pose SessionStateReveal(sid ' ) by the security de.nition; thus, A cannot know information about rA,1.


The attack model is related to our ACS Spoo.ng attack.

we exploit a logical .aw in the IdP s SAML interface implementation instead of SP-based XSS .aws.


Since our proposed scheme instantly checks the validity of received packets, the receiver only buffers valid packets.

distillation codes cannot immediately judge the validity of received packets.


This guarantee would be both extremely strong and easy to understand.

differential privacy actually provides a slightly different guarantee.


Thanks to the combination of di.erent enforcement techniques and the support for application contracts, our security architecture is able to provide policy enforcement for legacy applications, as well as architectureaware applications.

the latter set of applications Copyright 2007 ACM 978-1-59593-890-9/07/0011 ...$5.00.


According to the UBS data retention guidelines, backup tapes for email communications were to be retained for a period of three years.

during the discovery process, it was revealed that seven backup tapes were lost or destroyed through normal rotation, and relevant emails were deleted from employee s email clients, thus making retrieval impossible.


2.1 Applicability Our model presented is suited for non-cyclic graphs such as Figure 1, although we discuss an extension in Section 4.1.


5.3 Comparing Sandboxing and Language Overheads Past, published measurements of SFI-based sandboxing slowdown have considered only fully-optimized, ahead-of-time compiled versions of C and C++ benchmarks like SPEC [20, 44, 46, 56].

the SciMark Benchmark Suite includes C as well as C# implementations of its benchmarks.


Speci.cally, we remove non-terminating programs and the corresponding notion of pointed types ; non-termination is attractive in a general-purpose type system but not usually in a proof system.

we introduce type quanti.cation in the style of System F. This type quanti.cation enables us to model the speaks for relation.


Resistance is a measure of the degree to which the group does or does not do the work of executing the information exchange.

novelty is a measure of the degree to which the group has done prior work developing a persistent operational infrastructure to support the execution of the information exchange, including but not limited to: the production of documentation, the allocation of budget and staff, and the degree to which the information exchange is codified in contracts, laws and regulations As is the case with resistance, we consider groups to be more unified in their work practices if the information exchange is well established in both groups environment and more diverse if it is more novel.


With the di.erent wavelet bases and decomposition levels, the TSH transform [3] can extract different kinds of information from the media, and is therefore very likely to be used to watermarking and encryption [1].

the traditional .ngerprinting methods do not consider the relationship between users and the tremendous scale of social network, they then cannot be applied to secure media sharing in social network environment.


We slightly adapt PIRS so that the machines send their summaries to the client via the server, after authenticating them using another authentication scheme.

as we are the .rst to address authentication of dot and matrix products, there are no alternatives to compare to DMP and DDP.


The chunk attacks model an attacker who launches a continuous .ood of SIP requests for a long time in an attempt to overload the server.

the harmonic attacks model an attacker who launches .ood attacks in short bursts after frequent intervals.


Here, we assume that the cloud actsas asemi-honest party (honestbut-curious); whichfollows the rules of the protocol but is free to later use the intermediate results it sees to compromise the security.

since the data is in encrypted form and the encryption scheme is probabilisitic, the intermediate results computed by the cloud are random values uniformly distributed in ZN .


the respective policy is edited to re.ect organizational changes such as employees joining or leaving the company or being promoted.

non-administrable authorizations do not change during work.ow execution.


In many cases, we expect the e.ective user ID to be the same as the real user ID, because access control is based customarily on the invoker, i.e., the user whose process is attempting access.

the e.ective and the real user IDs may di.er in cases wherein, for example, we want the authorization to be granted based on the owner of the program rather than the invoker of the program.


[19] proposed a privacy-preserving realization of image feature extraction in the encrypted domain.

applying the probabilistic homomorphic cryptosystems to SSP applications cause a problem, i.e., the storage space expansion of high orders of magnitude after encrypting plaintexts to ciphertexts [20].


Younger users may have developmental or language dif.culties which makes entering an obfuscated password challenging and frustrating [47].

people are living longer than before and the elderly sector of society is growing yearly.


Terra depends on a trustedvirtual machine monitor(TVMM), and thehardware andTVMM enable closed-boxVMs toidentify their software stack to a remote party.

user attestation and secure UI issues remain unaddressed by Terra.


Considering that industry average for SUS scores tends to hover in the 60 70 range [24], all tested methods fare relatively well in achieving mean SUS scores over 65.

p-IS-VS is clearly perceived as the most usable method (considering overall scores for groups of both sizes).


That is, in the scenario portrayed in this paper, medical telemetry should remain private across caregiver institutions, and therefore approaches like the ones cited above may not be appropriate for this application.

if researchers determine that information disclosure is necessary we believe that the following aspects should be considered: 1.


Attack graph studies assume that the system vulnerabilities are known.

we do not assume that the vulnerabilities are known (e.g., all known vulnerabilities may have been patched).


This leads to a clearly weaker type of security compared to a naive non-aggregation scheme.

eSAWN can signi.cantly decrease energy-consumption compared to nonaggregation, i.e., from O(log n) down to O(1) per node.


Boyd s statement shows that the OODA-possessing agent interacts competitively with other agents that also operate according to the OODA model.

the OODA model itself does not express his concept of tempo.


It is clear that the single point crossover technique eventually achieves the best .tness for all selection techniques.

the convergence of two-point crossover method to the best .tness is fastest (i.e.


Crypto++ is a popular cryptographic library written in C++ http://www.cryptopp.com.

it is non-trivial to compile crypto++ to non x86 architectures such as ARM, and in that case performance is a.ected since assembler usage must be disabled.


Security practitioners make heavy use of various virtualization techniques to create sandboxing environments that provide a certain level of isolation between the host and the code being analysed.

most of these are easy to be detected and evaded.