Source-dependent edges and sink-dependent edges: First, we compute the available source types and anticipated sink types for every edge, similar to the data.ow analyses in Figure 6.

whereas Figure 6 computes data.ow facts for nodes, we need to compute data.ow facts for edges.


the secret key that Sim cannot produce, because it contains the exponent ab.

since Kv,j = 1, G0 j is not nec- Phase 1: Secret Key Query.


2.1 Modern Hard-Drive Architecture The software and system architecture described here are speci.c to the drive we analyzed.

we observed that it is almost identical for two distinct drives from one product family of the same manufacturer, and a brief look at one drive from another major manufacturer revealed a very similar architecture.


The incident response process does not always track the intruder s location.

the persons responsible for the incident may be legally held responsible for their actions.


Such techniques allow users to divulge their data without disclosing their identities.

it is di.cult for the database owner to guarantee the quality of the database because a malicious user could send random data and render the database useless, or a competing company could send a great deal of made-up information to make their products the most favorable ones.


In such cases, the administrator must keep the time window of this obligation .xed, and attempt reschedule the other dependent obligations around it.

if this is not possible, then the administrator may consider shrinking the width of some of the dependent obligations time windows.


The key idea of OS-SOMMELIER is to compute unique core kernel code hashes as the signature from a memory dump to precisely .ngerprint an OS.

to realize this idea, we are facing several new challenges, especially for the widely used x86 architecture in the cloud.


The analysis presented above supports our common understanding and shows which factors typically in.uence the perception of contexts.

exceptions exist, like, e.g., those 4% who consider home a high-risk environment.


Since .rst proposed by Forrest [12], e.orts to secure systems through automated diversity mechanisms have focused more on randomized implementations (of memory layout [2] and instruction sets [1, 16]) than on functional diversity systems that have di.erent purposes and speci.cations, not just implementations.

diversity-introducing mechanisms such as address space layout randomization (ASLR) [20] have proven to be useful mitigation mechanisms and are now part of Windows Vista and many Linux distributions.


By default, this last requirement implies that a credential program will not be able to access persistent data of another credential program.

there are situations where such sharing of persistent data is essential.


AES does have the small disadvantage that its block length is longer.

in retrospect, AES might be a perfectly suitable replacement.


SUD relies on IOMMU, transaction .ltering in PCI express bridges, and IO permission bits in TSS to securely grant user space device drivers direct access to hardware.

sUD cannot be applied to the hosted hypervisors such as KVM simply because that hardware virtualization extension (e.g., Intel VT) is not constrained by the IOMMU or other hardware mechanisms that SUD relies on.


This is because if an input is followed by 1024 white spaces and then some non-whitespace regular command of less than 1024 bytes, the server can skip these white spaces and take the follow-up command successfully.

this input will be caught by the original pattern as intrusion because these white spaces themselves can trigger the alarm.


The fact that parts of the grid might have di.erent access granularity (i.e., the level of individual cells versus the level of blocks of cells) will allow us to achieve signi.cant savings in the data structure and key derivation time in certain systems.

we initially consider the case where the mn cells have distinct access rights (hence there needs to be a separate key for each cell).


This reduces the utilized network bandwidth considerably.

iBC assumes a trusted third party (TTP) to generate and distribute the private keys of the users, which does not .t with the characteristics of WMNs.


The Bot master is a relatively simple application that needs to send and receive messages, and the attacker is assumed to have full control over the machine running the Bot master.

the challenging app is the Bot that is deployed on the infected phones.


Establishing a concrete link between data breaches and identity fraud is oftendi.cultbecausemisuse may occurlong afterabreach, and misused information cannot directly be attributed to a particular breach incident.

the growing underground (criminal) market for stolen personal information strongly suggests that breached ID numbers can be easily sold and exploited[45].


These studies provide a strong foundation for the observation that protecting content from unwanted audiences is more than simply a matter of preventing strangers from accessing pro.les.

we are unaware of any large-scale studies that have attempted to quantify the extent to which users are sharing content inappropriately with members of their friend networks through the use of users previously posted content or questions about speci.c friends.


Many interesting trends on vulnerability patching and exploitation are presented, and support Frei s conclusion.

they basically looked at the same data: looking at EDB or OS-VDB may say little about actual threats and exploitation of vulnerabilities.


If we refer to .ngerprints or irises, a common acquisition will consist of a vector of several thousands of bits.

it would be unpractical to apply fuzzy hashing directly on the plain acquisition, since a number of impairments could jeopardize the identi.cation process.


and PROG P2 1k+1 O = A &07k-1Intuitively, one might argue that PROG P1 leaks more information leakage than PROG P2 when k is large, because it reveals complete information about the secret input with probability 81 ; on the other hand, when k is large, PROG P2 reveals roughly 18 of the number of bits in A.

applying the Shannon entropy measure and computing the mutual information I1 between A and O yields a counter intuitive result: 771 1 P 1: I1(A, O)= - log - log = k +0.169, 28k 8 88 27k-1 27k-1 P 2: I1(A, O)= -2k+1 · log = k +1, 28k 28k Indeed, from a security standpoint, PROG P1 leaves A highly vulnerable to being guessed (e.g., when it is a multiple of 8), while PROG P2 does not (at least for large k).


the red-color solid lines in Figure Figure 1: Attack-resilience vs. availability 1) leads to the best availability because any single node alone is able to sign a message.

this design o.ers the worst attack-resilience because compromise of any single node causes the compromise of all the private keys.


Note that the other tests do detect some di.erence between JitterBug and legitimate tra.c, but the di.erences are so small that it is impossible for these tests to di.erentiate JitterBug from legitimate tra.c without a much higher false positive rate.

the entropy test is able to detect JitterBug.


Each EP e in E(C) is denoted as: {itemset},score(e) Where, itemset is the item set which represents e, score(e) is the score contributed by e and its value derives from the following formula: Score(e)= (GrowthRate(e)/(GrowthRate(e)+1))supportc(e) (1) Where, supportc(e) is the support of e in class C, GrowthRate(e) is the growth rate of e. (2) Detecting Process The specific steps of detecting process are as follows: 1) Aggregating the scores of EP for the instance In the training process, we obtain the score of each single EP.

the fraction of instances which contain an EP may be a very small fraction of all instances.


The protocol uses a hash function to create commitment values to a current and future password .

as shown in [13], the resynchronization process rendered does not provide the recoverability intended, and in fact, enables an adversary to create selective forgeries.


DCsperformconcrete executiononpublicdataand symbolicexecution on sensitivedata, and mayperformqueries toDPs on sensitivenucleotides.

onlyqueriesthatdonotletDCsreconstruct sensitive regions are allowed by DPs and generic two-party computationtechniques areusedduringquery execution.


If we can predict the ASLR operation more accurately on general devices, the PMS recovery attack may be improved.

such a study is beyond the scope of this paper and will be the subject of future work.


X-Frame-Options are supported by all major browsers.

heiderich has shown that this defense can be bypassed via Java applets or LiveConnect [24].


The improved NOZZLE report a potential heap-spraying attack when it .nds an offset with success rate over 50%.

the enhanced algorithm cannot deal with the Type C and D attack, where there are many copies of shellcode in one heap memory block.


External validation criteria are particular attractive, because they offer a quantitative way to measure the level of agreement between the obtained clustering results and a reference clustering that is considered to be the ground truth [7, 16].

the main problem is exactly how to construct the reference clustering in the .rst place.


While consistent deception will give rootkit creators better tools for hiding their malicious code, inconsistent tactics will not be attractive to them because the inconsistency should attract the attention of administrators who will investigate the inconsistency.

deception will give attackers less assurance about success when installing a rootkit.


Synthesizing these trade-o.s into a single parameter is non-trivial.

combining the above evidence and the computational constraints ofSec.4.3, webelieve len(H ' )=3 months is a reasonable starting point for analysis.


Since the inheritance of permissions in the role hierarchy is always upwards, role-based access control models do not directly support a simulation of the *-property, which requires that certain permissions be inherited downwards.

role-based approaches have circumvented this problem by introducing two partial orderings, r and w,onthe setof roles, where r r r ' if and only if r ' w r.This gives rise to two hierarchies RHr and RHw to which read and write permissions are respectively assigned [13].6 this begs the question How should read/write permissions be handled?


reused, causing the compromise of one server to probably a.ect several independent applications as well.

it is an unrealistic assumption, that we will reach a situation, in which password-based authentication looses its signi.cance, even in the presence of well designed password-less techniques, such as client-side SSL authentication, and promising new developments, such as Mozilla Persona [30].


Cloud management Besides isolation, virtual machines can be saved, resumed and migrated.

the implementation of these features depends on the host s ability to capture and recreate guest state, something that Haven explicitly prevents.


Android tries to limit the number of permissions because having more of them simply lengthen the list of permission warning a user is going to see, further decreasing the usability of something that users are likely to ignore.

with the risk signal approach we investigate in this paper, having more permissions does not lead to more meaningless warnings.


In [2], the authors have used 4 signals for the SYN scan detection problem: (1) the number of error messages generated per second by a failed network connection (PAMP); (2) the number of transmitted network packets per second (danger signal); (3) the inverse rate of change of number of network packets per second (safe signal); (4) high system activity (in.ammatory signal).

the PAMP and in.ammatory signals are host based features which are undesirable because networkbased malware detectors are generally more reliable, robust, and, most importantly, generic and scalable than host-/OSbased detectors.


This strategy has the advantage of asking from the subject only the credentials necessary to gain access to the requested operation.

the subject is continuously solicited to provide credentials for each transition.


Solitude provides a simpler,but more coarse-grained isolation modelin which policies are primarily needed for .le sharing.

more importantly, access control requires correctly specifying policies, while with our commit sharing policy, errors can be handled until commit is performed.


Thus, it is e.ective to detect such a covert timing channel.

if the original correlations of tra.c are retained and the distribution is changed, then the conditional entropy test fails; but the entropy test works in this scenario by detecting slight changes in the distribution.


The main idea in IBE is to eliminate the public key distribution problem by making a public key to be publicly derivable from a humanmemorizable information on its owner, such as email address, phone number combined to a user name.

practical and secure IBE schemes were not found until two independent works of Boneh-Franklin [8] and Cocks [15] in 2001.


Since many samples collectively contribute to been employed to improve the detection accuracy, and the the detection of a watermark pattern, such verification wa- likelihood ratio test (LRT) has been utilized to construct termarking usually has high robustness, even though its ca-detectors accordingly [ll] [lo] [2].

in these modpability of recovering more than one information bit is not els attacks are not properly incorporated and the detections as high as the transmission watermarking.


Without changing X.509 or existing CAs, the server can get signed certi.cates from each CA independently.

sending multiple certi.cates for the same public key (signed by different CAs) is highly redundant.


On each platform, compartments belonging to the same TVD are executed within the same virtual domain allowing a free communication between them.

an information .ow between compartments of di.erent domains is only allowed if it does not violate the TVD Policy of both domains.


However, for this to work, we must ensure that the IdP is able to process such statements in order to assert them in the AuthenticationResponseEnvelope.

this solution goes outside the Liberty standards, and would potentially require the Liberty-Enabling software component to be modi.ed.


In the 10%,20%, and 30% cases, the measured frequency is higher than the expected number.

the difference between the measured numbers and expected numbers decreases as the percentage of hijacked contacts increases.


Since the constructed attack graph is rather simple, because it only involves one AMI, we are performing the analysis on an attack graph similar to the one presented in Figure 3.


Since the character boundary is modified by the watermarking process (described later), the FD after watermarking will change.

low frequency FDs determine the global shape and are relatively less affected.


The images reconstructed by EM emanations 2 m away from the tablet were the most obscure in the experiment.

we confirmed that the difference image between a frame with and a frame without a key input clearly enhanced the key input, as shown in Fig.


The simplest key derivation protocol would have the laptop derive a decryption key from a .xed m. Without access to the constrained channel, an OT will be unable to derive the key.

an attacker in possession of the laptop could quickly brute force the key, given the limited entropy of m. Instead, the TLD can possess a strong secret to help derive the laptop s decryption key and use m to ensure the requesting laptop is in the room and protect communication over the wireless network.


The proof size of the PI N O CC H IO BFS scheme is always a constant (288 bytes) see [30].

in our approaches (certifying algorithm and planar separator), the proof contains a 256-bit (32 bytes) HMAC for each edge contained in the shortest path, therefore being proportional to the size |p| of the shortest path p. Speci.cally, for the case of the certifying algorithm scheme the proof size is |p| × 32 + 288 bytes while for the planar separator scheme the proof size is |p| × 32 + 288 × num bytes, where num is the number of PI N O CC H IO circuits involved in the proof computation of the planar separator scheme (num is bounded above by the levels of the planar separator tree).


3.2 Implicit Flow Theoretical papers on information .ow control usually restrict themselves to languages without unstructured control .ow.

realistic imperative languages predominately contain some variant of goto like break, continue, throw, return, or try ... catch ... .nally.


These services do not manage instances or instance networks directly; they generally provide support for the cloud infrastructure, such as handling user requests, accessing the database, and so on.

services that directly manage instances and instance networks, such as nova-compute and neutron-plugin-agent require root privilege, as they need to obtain and manage host resources.


From Figure 2, it is easily seen that the total number of attack countries is 228 and about 60% of the all attack sessions was caused by only four countries, i.e., Japan, China, United States and South Korea.

in our further investigation, we observed that most source IP addresses in Japan are located in black hole sensors and honeypots, and some of them were caused by Unicast Flooding of L2 Switches[8] which generates incomplete data of sessions and makes IDS raises false alarms.


To save theperformanceloss, we use the explicitway of triggering control transfer according toNaT tokens.

to make it dif.cult for an attacker to guess the real control transfer by identifying the checkinginstruction(e.g., tnat and chk.s), we convert all explicit control transfer instructions to the form that uses the NaTtokens as oraclestodirectthe control.ow, as wellasinserting faked control transfer usingNaT tokensinbogus code.


We implemented this prefetching step asynchronously to avoid interfering with the user experience while loading the Web page.

after we examined the logs of our early releases, we decided to eliminate these automatic validation heuristics from iTrustPage for three reasons.


Because, for example, the Java implementation consumed 40 seconds to encrypt a block of 256 bytes, which makes it quite di.cult to consider using in real time applications.

the C++ implementation for ARM platforms has shown useful improvement in the running time.


More speci.cally, according to UCON, information characterizing an object-right combination, like the price of a service, must be contained into object s attributes [9].

the price of a service is actually derived from the subject-rightobject combination, resulting so in a di.erentiated pricing for the same pair of right-object requested by various subjects.


Honey tokens come in many shapes and sizes.

they all share the same concept: a digital or information system resource whose value lies in the unauthorized use of that resource [8].


3.2.2 Optional Element Context Proper security policy specification and enforcement can prevent attempts to move a signed element within a document when the element has a Simple Ancestry Context.

when an element is optional within the document, the specification of an enforceable security policy that prevents its relocation requires additional considerations.


3.2 Threat / Adversary Models In general, there is a conceptual di.erence between privacy and security.

in this paper, we will not differentiate the two terms.


In the case of hard-coded strings created through re.ection (by invoking a string constructor by name), our instrumenter for MetaStrings would not recognize the constructors and would not change these instantiations to instantiations of the corresponding meta classes.

the MetaStrings library can handle most other uses of re.ection, such as invocation of string methods by name.


Since a server only knows if two encrypted biometric data records match, we may think that disclosing the matching result is harmless.

according to [26], the matching result must not be leaked to preserve the security guarantee of the underlying encryption scheme.


If a cryptanalyst has ciphertext which is encrypted by one key stream frame and corresp onding plaintext, he can decrypt the plaintext which length is equal to the length of key stream frame f from another encrypted .le with same key stream pool.

to extract useful information from ciphertext, the adversary must decrypt ciphetext which length is longer than the length of minimal units of meaning(M).


Dynamic analysis is more efficient and does not need the executable to be unpacked or decrypted.

it is time intensive and resource consuming, thus raising scalability issues.


Among the many prior works on cryptographic techniques for privacy in wireless sensor networks, [18] and [15] describe methods to achieve authenticity and con.dentiality.

many approaches (e.g., [19, 9]) assume a pre-key distribution which impedes network creation and makes dynamic membership dif.cult.


ATTACKS AND IMPROVEMENTS ON YANG-SHIEH AUTHENTICATION SCHEMES  Yang and Shieh claimed that the securities of their authentication schemes are based on the difficulties of both factoring large numbers and discrete logarithm problem.

since the remote server does not check the integrity of the request message before processing verification, malicious users can forge a request message and make it satisfy equation (1).


Increasing the block size provides the neural network with more context information and can, up to a certain point, further improve the classi.cation accuracy of the trained network.

too many input actions can also increase the overall complexity of the neural network and slow down the training process.


Indeed, the u,t * STATu,t * adversary STATu,t * is given the value au,t * and for each h =1,...,m, the public value p(vh,.h),(u,t *) computed by Gen1 corresponds to the encryption of au,t * .

experiment Expm+1 is the same as ExpIND-0 .In u,t * STATu,t * deed, the adversary STATu,t * is given the value au,t * and, for each h =1,...,m, the public value p(vh,.h),(u,t *) com puted by Genm+1 corresponds to the encryption of the value ßm+1.


Various techniques for .ne-grained CFI have been proposed in the literature [16, 33, 4, 12, 27].

none of them is modular, meaning that dynamically linked libraries cannot be instrumented once and reused across programs.


Android and iPhone botnets have already been proposed [37, 49]; some have even appeared in the wild [49].

most of these mobile botnets used SMS or the Internet to build the command and control infrastructure similar to traditional botnets, and are therefore detectable via traditional botnet defense mechanisms.


TaintDroid imposes a runtime overhead because it runs continuously for all applications and hence the authors tested it on a set of thirty popular Android apps reporting that many of them leak privacy sensitive data.

piOS [6] employs static analysis techniques to detect privacy leaks.


INTRODUCTION Reverse engineering has good applications such as recovering valuable algorithms from legacy software, uncovering protocols and .le forms [8] for intrusion detection systems.


[20] introduced a Uni.ed Modeling Language (UML) model for Web applications that is useful for structural testing.

this model concentrates on links between Web pages and interactive features of Web applications, and does not provide support for distributed object components.


Inour previous work, we identi.ed the need for modeling support of identity and access control models from the experiences gained in the area of role engineering (see, e.g., [34 37]).

to enforce the corresponding access control policies in a software system, the resulting models must also be mapped to the implementationlevel.


Describing convincing use cases or presenting case studies with experts are often the only reasonable ways.

also these results are often subjective and hard to compare to alternative approaches.


Nested paging is a signi.cant step forward for hypervisors.

as discussed in section 3.1, the InkTag hypervisor s primary means of enforcing privacy, integrity, and access control is through detailed management of OS page table updates.


Processing evidence involves acquiring a bit-stream data image of a subject s disk drive .

[4] the investigation may require additional personnel for specialized operating systems or equipment, since one person cannot know everything about every technology.


writing a password down allows the user to remember more elaborate and more secure passwords, and if the password is kept at home, having a written copy of it will likely never risk exposing it to anonymous online attackers.

many users do not securely store their recorded passwords, and instead choose to keep them in online locations that are more easily accessible but more vulnerable to attack.


A great deal of effort has been dedicated in recent years to the standardization of elliptic curve cryptography.

there are still some areas where work remains to be completed.


Potential Pseudo Zero-Day attacks are attacks similar to Pseudo Zero-Day attacks.

a black-hat hacker has not yet exploited the vulnerability.


actly where a traced phone s wireless beacons might have emanated.

this is frequently approximated by using a sphere of a given radius.


The resolution starts from the initial state (pre-computed when the database is initially populated) and then gradually seeks a .xed point of state changes with iteration (due to various transfer functions).

as the state space might be huge (due to combinatorial explosion), the convergence progress could be slow or even unavailable.


1 There are a total of 831 1The VCL data was provided by the VCL management team, while the EC2 data was retrieved from the public Amazon Machine Images (AMIs) listed at Amazon s AMI page (http://developer.amazonwebservices.com/connect/  VM images in VCL and 575 public VM images posted at EC2 s AMI page.

more than 91% of the VCL images and more than 96% of the EC2 images have not been updated for at least 1.5 months.


Service providers take advantage of low cost cloud infrastructures, while service users enjoy convenient services without worrying about the cost of maintaining hardware and software.

large datasets have been collected, stored, and analyzed in business intelligence and scienti.c computing for several years.


INTRODUCTION The Android OS is widely used in mobile platforms.

in spite of the popularity of the Android OS, it has many security holes.


its scale can be controlled by adjusting block size.


It is important to note that our approach can only detect malicious web pages that make use of redirection chains.

this is not a severe limitation, because, as previous work pointed out, the use of redirection chains is pervasive in the malware delivery process [10, 13, 23, 29].


If the Identity Data Service triggering the dependency is at lower privacy level, then having shared the list of user data elements during the Link Creation phase, it is expected to share the values of these elements in this resolution phase.

if the triggering Identity Data Service is at a higher privacy level, then it would not send any data elements, indicating the other Identity Data Service to honor its end of the privacy level and return with the appropriate user data elements, which have been federated from its end.


The authors also give informal de.nitions of client and server privacy.

pSI approaches are generally distributed, and an e.cient extension to an n-party protocol is challenging.


that customers must completely trust their cloud providers with respect to the con.dentiality and integrity of their data, as well as computation faultlessness.

another important area is often overlooked: if the Cloud control interface is compromised, the attacker gains immense potency over the customer s data.


= 9, RF performed the worst due to its high false positives rate.


In contrast, Sec View(Position,acp2) is given by: Map(Pos, SID)(Filter(Position.Platoon =X.Pos=Target( a)-d.Pos=Target(a)+d.ts=TAction start(a).ts= TAction end(a))(Position)).

we assume that if an action is not currently taking place the evaluation of Target(), TAction start(), and TAction end() for that action returns null.


All four app popularity distributions curve in the log-log plot.

other than the Android (pop) dataset where no apps have less than 30 ratings, the rating contribution patterns appear to be straight lines in the log-log plot, suggesting that they could be a Power Law.


SUNDR [8] protects the integrity of data stored on an un trusted server and uses versioning to ensure that the order of updates to blocks of data stored on the server is preserved.

sUNDR only provides a guarantee of fork consistency to the clients, which means that a malicious server can lie to clients about the contents of .les so long as it lies consistently to each client.


If one is to use a hash function to hash messages of arbitrary length to the fm bits, then the security of the signature scheme further relies on the collision resistance of the used has function.

note that collision resistant hash functions exist under strong RSA assumption.


Also, longitudinal studies (observing a phenomenon over a longer period of time) might be applicable.

the original meaning of the term within the paradigm was meant to convey exactly the opposite, namely uncertainty about effects, and the ability to learn from unexpected observations.


This because XACML assumes all PoEs be available to enforce any policy (or combination of policies) set by any party in the enterprise and there always exists an enterprise administator who can solve con.icts.

this is not the case of scenarios in which PoEs are administered by autonomous parties.


Our hypothesis is that there must be a tradeoff between the number of secrets asked and resistance against impersonation attacks.

to the best of our knowledge, in the literature there is not a security analysis concerning the use of several secrets in the abovementioned manner.


First, the users in collaboration systems are af.liated with organizations and are thus subject to organizational policies.

social network users have fully control on the information in their pro.les and are not normally restricted by the security rules from others.


Similarly, consider the execution of the program on the normal programinputGET /index.html HTTP/1.1.Forthis simple function, a singleinput already exercises alargeproportion of the code(forinstance,it executes all of thelines of non-error codein the .gure).

examining this single path is not enough to elucidate the relationship between the variable ptr and the input, because that relationshipinvolves controldependencies.


Wagner and Soto pose the problem of generating such an attack sequence as a .nite-state automata intersection problem, and generated a mimicry attack consisting of over 100 system calls that achieves the e.ect desired by an initial exploit consisting of 8 system calls.

they did not implement a working mimicry attack.


Although not a pure e-voting scheme, Kellerman and B¨an ohme [19] proposed event scheduling protocol that inherits several security and privacy requirements from the e-voting context.

a formal study of such properties and experimental performance results are missing in their work.


Such networks now face all sorts of security threats identi.ed in traditional networks.

solutions found in traditional networks cannot directly be adopted by LLNs, due to the inherent limited capabilities of the embedded systems that comprise them.


Viewed in isolation, each improvement often seemed moderate in scope.

we felt, and our colleagues agreed, that the modi.cations were the di.erence between our system possibly being used by the analysts versus never being used.


We present a new system, SwitchBlade, that uses randomized and personalized .ne-grained system call models to increase the probability of detecting code injections.

using a .ne-grain system call model, we cannot exclude the possibility that the model is violated during normal program executions.


Consider the following example, where a participant of role A cannot be a participant of role B.

role C s admission constraints require that its member has to be a participant of both role A and B when joining C,which cannot be satis.ed.


For deployment of UDDI nodes and services within a private enterprise environment, the tools provided by the UDDI v3 specification are likely sufficient to support the requirements of registry security.

as commercial business registries begin to emerge and registries begin to federate, there may be additional aspects of security that need to be addressed.


So, on the one hand, the user should select kto be very large to cope with a lot of compromised nodes in the network, i.e., a high ß.

a larger kimplies higher energy consumption: As shown in Section 5.1, the larger kthe more network tra.c and en-/decryptions result.


3.3 Proposed Security Objectives Existing EOIs are far from being standardized with respect to the document format, data types, and physical or digital security features.

deployed EOI differ across countries and are even diversified inside the same country.


In fact their solutions constitute upper/lower bounds for reachable key-availability and key-vulnerability values respectively.

in realistic scenarios, often a good balance between key-availability and key-vulnerability is demanded.


Research on methods of authenticating websites to users include security indicators [6, 20], secure bookmarks for known websites [8, 51, 53], and automated detection and blacklisting of known phishing sites [10].

studies suggest that security indicators are ine.ective at preventing phishing attacks [9, 40]; and blacklisting known phishing sites still cause the problem of a high rate of false-positives and false-negatives [54].


3.3) is suited to be installed on the client-side as a companion to the Web browser.

unlike on the server-side, the issue of con.guring the proxy is non-trivial.


The random number in the authentication vector can make sure each authentication vector is unique.

the UE cannot record all random numbers it received before.


present a logic model that can be used to analyze, develop, and prove systems that use what they call consumable credentials i.e., credentials that provide authorization only a limited number of times, such as coins, tickets, and similar tokens in both the real and digital worlds.

as far as we understand, although they discuss how consumable credentials (which are essentially count-limited objects as well) can be used, they do not answer the question of how these can be implemented.


observed that PC malware exhibited reduced behavior in nearly 40% of unique samples when run in debugged environment, and 4% of samples when run in a virtualized environment.

the samples that exhibit alternate behavior due do environment accounted for 90% of attacks during particular time periods [15].


This scheme uses ultrasonic distance bounding to perform proximity veri.cation with high accuracy.

it exhibits high energy consumption due to the computational complexity of the DH key agreement protocol.


It is obvious that the layered analysis for Merkle-Damg°ard designs is much more intricate than those for the sponge functions.

the permutation of Keccak is simple and clear arguments for its security can be provided, but the detailed analysis of the bit-oriented permutation is more complex; there is a need for new techniques to provide better security bounds, in particular for variants of the permutation with a reduced number of rounds.


for location-based services in the absence of GPS.

their databases are proprietary, not open to the public.


domainname) on mobile phone User notices the difference, and refuseauthentication.

access denied Figure 9: Measure against MITM attack this method depends on the user s judgment, so more effective ways are still required.


detecting spam proxies is the major task of DBSpam, and proxy identi.cation and spam tracking can only be accomplished through tra.c analysis.


Their simulation study focuses on guard selection and adversarial relays.

this paper explores Tor s vulnerability to traf.c correlation attacks (explained next) using various pro.les of client behavior, adversary models, security metrics, and topological models of the Tor network.


These techniques are powerful in terms of their robustness, semantic-preservation, obscurity, resilience, stealth, and other properties [7, 11, 15].

most existing techniques 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


This approach is appealing because it is simple, practical, it introduces minimal extra state to untrusted programs, and it seems to cover most of the enforceable security policies discussed in the literature.

the formalisms presented in this paper do not assume any particular method of representing object states at runtime.


Booby traps can directly serve as a replacement or enhancement to the intrusion detection portions of these systems.

booby traps have the advantage of being a reliable source of attack information, since they can only be triggered by a program bug which attackers then exploit.


For specific scenarios, this tradeoff may be addressed by specific parameterization.

for implementation purposes, we decided to have t=n-f, while also leaving room for a possible future employment of a byzantine fault-tolerant protocol requiring 3f+1 replicas to decide on a correct value.


The use of this model is motivated by the observation that, in most cases, strings used in JavaScript code are human-readable and are taken from a subset of some well-de.ned character set.

attacks often employ strings containing unusual characters, e.g., non-printable characters, in order to encode binary code or to represent memory addresses.


All of the three above methods can be implemented using reflection using Java or C/C++.

if the Context is acquired via C/C++, it has to be transferred to the Java world through the JNI interface.


Hence the signature based mitigation may be effective for real-time forgery detection.

real-time signature verification by its nature will always be susceptible to denial-of-service attacks.


If we try this query on all 232 values of v, from 0x00000000 to 0xffffffff, then we will know exactly how many outputs are feasible.

experiments show that on average each of these queries takes 28 ms, which implies that it would take 3.8 years to complete the 232 queries.


The first type of compromise corresponds to a denial of service, i.e., a legitimate entity is prevented from completing a legitimate action.

the information itself is not compromised and its effect on the system is benign.


From this point on the member should use this identity whenever she initiates registration to CCR services from other communities.

this identity may be different than the one the member uses within a community.


Users start by touching one of the dots to make it the start point and swipe their .ngers to add dots and form a pattern.

there are some constraints while setting a scheme.


), this dramatically slows down the rate at which an attacker can make guesses, crippling the attack.

the system was never implemented, and if one is truly concerned with practicality, implementation is everything.


On testing with these sizes, the gain in speed is negligible.

on testing the same variations without the compiler optimization .ag, we see a more noticeable di.erence.


If their jumping is constrained to at most n pages, our XnR virtually has no impact as no page faults will be triggered during execution.

if a program continuously accesses more than n pages, this results in constant eviction of pages from the process address space and results in a performance degradation compared to a stock Linux kernel without XnR checks.


As mentioned in Section 3, Aquifer uses a default-allow policy to ensure compatibility with legacy applications processing unconstrained data ob jects.

the policy becomes default-deny if restrictions are present.


Apart from the fact that we cannot ignore I frames when encrypting low temporal frames we can clearly seethat encryptinglowtemporalframes also su.ciently destroys the visual quality.

since we have to encrypt all I frames in addition to the low temporal frequencies it is usually su.cient to either encrypt I frames or low spatial frequencies (with or without full I frame encryption).


Taint checking has also been proposed to combat the problems of using untrusted data returned by an API [34, 48].

this requires security-aware developers, and only provides an indication that the data is potentially malicious, not why, what it can be used for, or how to neutralize it.


3.2 Discovery It is a requirement of the bridge design that every bridge client should be able to discover some small number of bridges; otherwise the fact that bridges are hard to block does not improve the ability of censored users to circumvent blocking.

it should not be too easy to .nd the list of bridges, or they become as convenient to block as the public relays.


This situation has called for automatic methods for program analysis and many such methods have been developed in the past.

many of these methods are of little help in the above setting because especially malicious software generally employs techniques that make it hard to analyze automatically (obfuscation, subversion of the kernel, etc.).


INTRODUCTION Recent experiments [26] and real-life attacks [6] have offered concrete evidence that link-.ooding attacks can severely degrade, and even cut o., connectivity of large sets of adversary selected hosts in the Internet for uncomfortably long periods of time; e.g., hours.

neither the root cause nor pervasiveness of this vulnerability has been analyzed to date.


To the best of our knowledge, nearly all x86 introspection techniques use CR3 to isolate the process execution context (cf., [21, 22]).

the value of CR3 does not directly reveal process identities; for example, it does not reveal the process s name.


[33] mediate web applications at a much coarser granularity of web pages while also using a speci.cation of roles, and infer the difference between sitemaps of privileged and unprivileged roles as the de.nition of security-sensitive operations.

our approach proposes concepts that are applicable uniformly in all domains.


Of course, threshold in the filtering is freely set by users.

if it is set high, important e-mail is filtered by mistake and if it is set low, computer virus invades computers.


Ru may promote actions like those seen for deletions: i) the update of tuples referencing tuples involved in Ru via tit's with Cascades modality; or ii) the update of foreign key values in tuples referencing tuples involved in Ru via tit's with Nullified modality.

if one tuple t references one tuple involved in Ru via one tit with a Restricted modality, t blocks the execution of Ru.


Alice could then send messages to club members without being a member herself.


Our approach o.ers practical performance overhead of 3 - 9.6% on CPU intensive benchmarks.

the alternative runtime parsing approach incurs 78% -510% overhead on the same benchmarks.


Besides ticket disseminating, Rep-Cloud incurs an extra overhead: SGTM of a target node is fetched every time when a local attestation towards it is performed.

as newly generated attestation tickets are disseminated to the corresponding nodes, GTM of each node is kept updating continuously.


CD2FA synthesized immediately after reduction phase are generally compact as i) there is reduced number of labeled transitions in the D2FA and ii) all default paths are bounded to a single default transition leading to compact content labels.

even more compact CD2FA can be created by allowing longer default paths for certain states, specifically the states where not many labeled transitions enter.


One concern about process-based isolation is the performance overhead brought by context switches and interprocess communications.

we believe it should work with most Android applications after a careful analysis of the Android NDK and usage patterns of most cellphone applications.


That is, ConstructCascadeBF always has enough space to allocate to the counting Bloom .lter of the .rst level of the cascade, and can afford to have just one more level, which is the explicit list.

the sparse memory available for counters in the second strategy requires ConstructCascadeBF to allocate more levels in the cascade Bloom .lter.


The servers return a non-repudiable audit proof to the domain such that the domain can provide its certi.cate along with the audit proof to clients for a TLS connection setup.

as CT s goal is only to make used certi.cates visible, it is still vulnerable to attacks when an adversary compromises a CA to create and register the fraudulent certi.cates, and CT does not prevent clients from accepting these certi.cates.


A chunk is considered erased if it resides on an erased block, that is, the block is devoid of any data and contains all 0xFF values.

expired chunks contain once-valid data that has been replaced by a more recent chunk.


Currently, the system has not been tested in stress conditions.

considering that all packet routing is done by packet capture (via the libpcap mechanism) in the user space, we believe that once the current system reaches its limit there can be a great deal of optimization, such as kernel-level packet management and/or net.lter integration.


we notice here is that, with real software running on the machine, we are able to have many more interactions with a single attacker.

with honeypot pages, we are able to reach many more attackers, but the number of interactions with a single attacker is far smaller.


The results show that the BDR doubles when we use the Classify-Verify approach.

the BDR is still very low due to the exceptionally high FPR in this speci.c setting.


If the DMV could not satisfy the policy protecting Bob s library card, then Bob would not transmit it.

the DMV can still get as much information about the credential as it can legally know namely, the policy protecting it and the fact that the DMV cannot satisfy it so we consider the attack a success in this case.


The authors do not explicitly specify the value of n used in their study.

from an example provided in the paper, we deduce it to be 2 (bi-grams).


That is, the DKs are unique session secret keys between two communication devices, which protect xDLMS APDU transmitted between a COSEM client, Central DCS or Concentrator, and a COSEM server.

dKs are transmitted after being encrypted using a Global Unicast Encryption Key that is shared among the Central DCS, Concentrator and COSEM servers.


In other words, if the subject does not posses the necessary credentials it may be more appropriate to say that it is unknown whether it is competent rather than adopting the Closed WorldAssumption(CWA)and automatically assuming that it is not.

not belonging to a particular category may be deemed as su.cient to establish that the subject is not competent.


It should be noted that Alice can choose to dthe rules of the schemes, and this scenario is outside of our model.

alice has no disincentive to break the rules because the attacker cannot detect the alarm.


Since there is a huge di.erence between the simulation time (e.g., in the magnitude of nanoseconds) and the prediction time (e.g., in the magnitude of seconds) for obtaining the output signals, PUFs can be used as a security key for identity authentications in many applications [10][31][33][48].

a direct use of PUF with randomly generated challenge bits cannot resolve the replay attack, since we must ensure that the collected power pro.le in the monitoring process are those generated from the speci.c sensor at the speci.c time frame.


In particular, it is not necessary to store all record layer messages to input to the hash function all at once, as common programming APIs for hash functions allow the hash value to be provided incrementally.

the cost of the MAC computation can dominate the cryptographic cost of record layer computations [15].


Customer-centric Energy Usage Data Management and Sharing in Smart Grid Systems Gaurav Lahoti* University of Illinois at Urbana-Champaign Urbana, IL lahoti2@illinois.edu  ABSTRACT A recent study revealed that .ne-grained energy usage data could potentially leak sensitive information about an electricity customer.

a number of online service providers utilizing such data have emerged and improved e.ectiveness of smart grid technologies (for instance, demand-response aggregators), and therefore sharing of data is getting popular.


But since the vast majority of users does not have such new processors yet, a solution that relies on these features would not be usable for them.

our approach works for all x86 standard processors of the last ten years.


This suggests that the existing access controls can be improved.

it is unreasonable to expect that an access control mechanism will prevent all users from ever sharing content inappropriately.


Note that in AES encryption and decryption are done with the same key.

in our implementation we store encryption and decryption key separately.


different sub sequences for which the hash is computed may result in having the same hash value.

the advantage with the filter-hash value is that it is a computationally inexpensive hash value.


If the target system were solely user-level applications, then the predicate could execute in a separate user-level process.

one of our goals is to execute predicates that check for the triggering of vulnerabilities in the operating system, and predicates that run in a user-level process (or in the kernel itself) cannot execute without perturbing the operating system.


By default the TSC bit is set on both native and virtualized operating systems.

ether explicitly disables it, thus breaching a preset condition that no modi.cations are made on the state of the guest.


The Repairable File Service assumes an administrator has already identi.ed the process that started the intrusion; it then uses the log to identify .les that potentially have been contaminated by that process.

backTracker begins with a process, .le, or .lename that has been affected by the intrusion, then uses the log to track back to the source of the intrusion.


Based on our survey results, users seemed especially concerned about its ability to access their phone number and location, including the fact that it appears to query their location very frequently.

they were not concerned about its use of the Internet.


Furthermore, when the PUF is polled later, this code can account for three corrupted symbols (potentially up to 12 bits in the PUF).

in our experiments, the average Hamming distance between the original PUF response and later responses was 0.1, with a maximum of two bit errors that occurred in one execution.


Prior workhasyielded a number of elegant(if not always ef.cient) cryptographic protocols for secure computation on DNA sequences.

weidentify some notable openproblems: 1.


This choice prevents CSRF attacks from di.erent origins, as authentication through implicit HTTP-authentication or cookies is defeated (i.e., no false negatives).

the impact on the user s web browsing session is minimized (though still present), as the majorityof cross-domain requests are not blocked, but modi.ed.


With PaX ASLR in place, such exploits must guess the segment o.sets from a search space of either 40 bits (if stack and libc o.sets are guessed concurrently) or 25 bits (if sequentially).

our return-to-libc technique uses addresses placed by the target program onto the stack.


The other evasion is that, a malware program does not exhibit any behaviors monitored by Secom.

such a malware program can not make itself resident in the host, hide itself from anti-malware tools, or even propagate itself in the system.


Stealthiness constraints The work in [14] provided conditions under which replay attacks with access to all measurement data channels are stealthy.

these attacks are not guaranteed to be stealthy when only a subset of the data channels is attacked.


R;that is, there exists a permission-role assignment function.In this case, the security level of the permission is .r.

this is likely to be too restrictive a requirement in general RBAC models.


Moreover, time for matching elements in database becomes short when Bloom filter is applied, since Bloom filter index has fixed size and is often shorter than the length of the element.

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


Proxos does not need to do this because security-sensitive applications that need to communicate would already have their own private OS over which they could communicate.

the original design of Proxos required some porting of applications to target the private OS, which was intended to be minimal and thus had less functionality than the commodity OS.


Examples include the coordinations among users through ps and among the apps using audio resources through AudioManager.requestAudioFocus.

those old design assumptions on the public resources are becoming increasingly irrelevant in front of the fast-evolving ways to use smartphones.


s scheme [21], as a concrete implementation of the above paradigm, outperforms the previous schemes [9, 8, 15] on both signature size and computational cost.

we discover that their scheme has a vulnerability with regard to invisibility.


In practice, we may assume that the revocation manager is trusted.

an auditing of revocation can be a function supported by the license.


The future of computers is leaning towards: more personalized hardware to match user habits; less distributed systems; more generalized content, more specific cryptology; smart card identification; biological security; more peripherals and accessories; smaller architecture; biometric technology; expanded civic/social uses; and medical potential.

with visually impaired persons, the greater concern with the technological advances is the lack of security in these devices when accessing the Internet away from home.


This appears to contradict to our experimental result.

this discrepancy can be easily explained: the CAPTCHA used in our study was much more distorted than the Google scheme.


If R0, R1, S, Z, g, and h are not formed correctly, it could potentially mean that the security properties for the TPM/host do not hold.

it is su.cient if the platform/host (i.e., owner of the TPM) veri.es the proof that R0, R1, g, and h are computed correctly once.


Although time-based constraints can be used to mitigate the problem, they are not always sufficient in order to provide satisfactory results.

in ad-hoc networks based on wireless communications, all messages are essentially broadcasted.


Similarly, access to the local disk, network, memory, and cache are all sharedby virtual machinesfrom multiple customers.

with this ef.ciency comes performance interference.


Software diversi.cation techniques such as librando [21] are used to diversify JITted code to mitigate JIT spraying attacks.

past techniques suffer from two main drawbacks.


For example, the messages used to measure the overhead of the SQL server .lter have the .rst byte equal to 0x4 to force the .lter to check if the remaining bytes in the message are di.erent from zero.

the messages sent to the stunnel .lter have no % characters because the .lter stops processing the message bytes when it .nds a valid format speci.er.


For the presented example, EarlyBird seems to detect the attack faster than the regular SVM, because it focuses on the obfuscation instead of the heap spraying.

this is only a small extract from a far more complex detection model with several millions of events.


4.2 Linear Temporal Logic LTL As pointed out above, we can specify the FSM with the help of the SMV input language.

we also need a way to specify the properties which the FSM should satisfy.


This has a marginal overhead on a selection of scienti.c applications, which are slowed down by 0.7 -6.5 percent in runtime.

identity boxing is more expensive in meta-data intensive application such as a program build, which is slowed by 35 percent.


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

none of prior studies implements cost-bene.t analysis of kernel tracing systems for forensic readiness.


As we can quickly reach from the source proof to the destination proof using larger links, we observe better performance with increased link  (a) Provenance Generation (b) Sequential Veri.cation (c) Sparse Veri.cation Figure 1: Time Required in Different Operations for Block Hash Chain (a) Provenance Generation (b) Sequential Veri.cation (c) Sparse Veri.cation Figure 2: Time Required in Different Operations for Bloom Filter (a) Provenance Generation (b) Sequential Veri.cation (c) Sparse Veri.cation   Figure 3: Time Required in Different Operations for Multi-link Chain size.

if the distance between the source and destination Space Requirement: Space requirement does not vary with link proof is less than the link size, we cannot utilize the bene.t of using size for this scheme, as we do not need any extra storage for the multi-link chain.


The inheritance hierarchy relationship GM 2I RM 2I RC enables user u1 and u2 to acquire the permissions of junior roles RM and RC by activating the senior role GM.

activation of role GM does not entitle u1 or u2 to inherit all the permissions of role TM without activating TM.


For example, ifb is very large, viruses can all 100 1400 1200 1000 800 600 400 200 500 1000 1500 2000 25003000350~  4o0o~  1 3500 I 10 I 3000 I t 1 2500 l I000 I  2000 1500 1000 l t  500 ~ = ~ ....... 500 1000 1500 2000 25'00 y Figure S: Orbits for various predatory rates (upper figure) and predator multiplication rates (lower figures) with other param- eters fixed as (xo,Yo) = (100,1),r = 2. be eliminated rapidly, but at the same time there will be an outbreak of predators, degrading the network.

a smaller b will allow viruses to dominate the network.


Thus in the absolute worst case, the overall cost is O(n 3) which is still signi.cantly better than the exponential worst case of tiling.

in practice, due to the sorting and quick termination strategy, the algorithm takes an order of magnitude less time.


Then we propagate the taint of the base and skip that of the index.

the use of add and mov instructions to calculate pointers is extremely common in real-world code and these cannot be monitored in the same way.


The work referenced speaks to the impact worms can have on the Internet.

they do not capture the mechanics that are the source of the potency nor do they provide guidance for developing defenses for an enterprise.


Box 1 Yuseong, Daejeon icshin@ensec.re.kr aforementioned areas.

no fruitful harmonies on these matters have been obtained yet.


Their results con.rm that hypervisors present a new attack surface through which privacy and isolation guarantees can be compromised.

defenses against such vulnerabilities are already being proposed in the academic literature [35].


In addition, we also .nd his personal home page address.

until now we are not sure the owner of this QQ account is exactly the one has WeChat ID of t106322XXXX .


Owing to RBAC s advantages (e.g., being policy-neutral and the ability to support a wide range of access control requirements) it is widely supported in commercial operating systems and database systems.

the administration of large RBAC systems is a complex and challenging task.


A TPM implemented completely in software could be migrated simply by issuing a suspend operation (TPM_SaveState), moving the non-volatile and volatile state out of band, and issuing a resume operation (TPM_Startup / ST_State).

a virtual TPM implemented in secure hardware would not release its state for migration.


As a .nal point on foundational matters, we note that sessions, delegation, denials of permissions and con.ict resolution strategies are not considered in the version of the meta-model that we describe in this paper.

these notions can be naturally accommodated if needs be.


Usually an Android application queries the contact application and receives only the entries a user picks, which is several bytes long.

sogouInput attempted to dump the whole contacts data repository.


Zack Weinberg Carnegie Mellon University zack.weinberg@sv.cmu.edu Collin Jackson Carnegie Mellon University collin.jackson@sv.cmu.edu  videos, and other documents from any site.

the document s scripts may not directly examine content loaded from other sites.


While for a small initial matrix the brute force approach tends to be quite fast, for larger matrices it becomes increasingly unlikely to .nd a viable parameter vector that actually results in a state transition.

since no heuristic knowledge about the model is used, there is of course no guarantee that even frequent state transitions gain progress towards .nding the desired right leakage, so the overall success of this heuristic is largely random.


In our case study, meters were communicating with the smart collectors using both the power line and wireless media.

the analysis and technique discussed in this work is generic and should hold across other communication models as well.


This early evaluation termination immediately leads to non-robust policies.

even an APPEL preference containing a single rule might not be robust.


It could model most of the protection systems in use at that time when it was proposed and many years thereafter.

the safety of the HRU model is undecidable in general.


In teaching computer systems, it is natural to adopt a bottoms-up approach that starts with the lower levels of a single computer (computer organization and then operating systems) and finish with the issues involving networking computers together.

with respect to security, we argue that the more natural evolution starts with the network and then examines issues involving a single computer.


CONCLUSIONS In this paper, we argue that fundamental risks arise from sharing physical infrastructure between mutually distrustful users, even when their actions are isolated through machine virtualization as within a third-party cloud compute service.

having demonstrated this risk the obvious next question is what should be done?


Furthermore, when they are properly managed and secured1, there is considerable scope to make them part of enterprise s overall security strategy.

little work has been done to extend remote management capabilities to a mobile platform.


4.3 JavaMOP versus AspectJ Aspect Oriented Programming (AOP) is well known for best specifying security concerns, due to its modularity and the its ability to seperate concerns and crosscut them where needed.

as shown in [28] , using AspectJ becomes a hard task when it is used to specify event-history based speci.cations, or moreover when used to enforce speci.cations on certain objects of classes (parametrized speci.cations).


This de.nition of logs is very broad and encompasses many data sources such as tcpdump packet capture .les, Snort alert logs, Apache access and error logs, Linux authentication logs, etc.

it does not cover other log .les such as the Linux kernel log for which the format is more permissive, and Dpkg logs, for which each event can span several lines.


In particular, if the device has a strong entropy source (the device can repeatedly sample from the uniform distribution over a large set of values), running the protocol never weakens the device s cryptographic keys.

if the device has a weak or biased entropy source, running the protocol can dramatically strengthen the device s keys by ensuring that its keys incorporate su.cient randomness.


To demonstrate this weakness, we created a scenario with the following steps: Create file 1 with two encrypted 4-KB blocks, C1 and C2  Create a backup B1  Update C2 with C2  An attacker can take a disk image dump B2 and analyze B1 and B2  We gained access to the original source of AON-ext3cow.

we were unable to retrofit the environment to conduct our experiments on the actual system.


GetProcAddress: This API takes as its argument a module handle and a procedure name, returning the address of the  speci"edprocedure.

thereturnedaddressturnsout tobean unconvertedaddress,andthisismostlikelybecause of how functions are exported in windows.


A session S is Q-minimal only if S is an antichain.


Currently, when the phone is rebooted, our Bluetooth virus will cease to take e.ect.

it would be fairly easy to take additional steps and package our executables into a cab .le, which is essentially an installer for smartphone programs.


However, the IdP can enforce the generation of a new certi.cate and may automatically import it into the UA.

this can be achieved on the .y and without any user interaction by using HTML5 in combination with the -Tag.12 since the automated deleting of the generated certi.cates is not possible, this feature should be used carefully regarding the key storage of the browser.


The drawback of thisbehavior is the impossibility to collect statistics on the occurences of a regular .le, either in non-deleted or deleted form.

it is alwayspossible to count how many times each identical cluster is found in the memory dump.


We consider each transition probability a potential feature.

in the transition matrix we have kn distinct transition probabilities.


These systems fall outside our de.nition of I/O data obliviousness.

other researchers [9] have already developed techniques that are orthogonal to ours in order to evade existing contentbased IDS.


One can easily select diverse upstream DNS servers from this list.

careless selection comes with major cost: increased delay due to forwarding queries to distant upstream DNS servers compared to closest local upstream DNS server.


the chance of correctly guessing the right PIN from a set of 50 PINs is 1 50 = 2%.


As user-1 enjoys the best channel/noise condition, it obtains the highest rate, followed by user-2.

the rates of the three users converge to same value by the ratebalancing algorithm.


In terms of cost, devices such as the IBM4758 or IBM4764 are not cheap; the former retailed for $2K, and the latter for signi.cantly more.

in terms of computation, Agnes immediately runs into problems should C s code or data become larger than what .ts inside the coprocessor.


National opinion polls (offline and on-line questionnaires) have sought to capture users perceptions to help direct privacy protection advancements.

the results from these surveys have done little more than identify the importance of computer privacy for users (Harris & Westin, 1998) and have substantiated privacy advocates perceptions of data usage.


Modeling and veri.cation of systems is essential to verify that a given a CPS satis.es functional correctness and meets the expected criteria.

two shortcomings exist: 1) representation of the concurrent and distributed interactions within a CPS while capturing the discrete and 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 pro.t or commercial advantage and that copies bear this notice and the full citation on the .rst page.


Methods proposed for preventing the capture of one s face include hiding the face with an unfolded shell [1] and painting particular patterns on one s face [2].

such methods hinder face-to-face communication.


Gray Risk: from disclosure to patch the software user waits forthe vendorto issue apatch.Wecall the riskexposure arisingfrom this periodthe Gray Risk because the public is awareof this riskbut has notyetreceivedremediation from the software vendor/originator.

through the information in the disclosureofthe vulnerability the user can assess his individual risk and mightimplement othersecurity mechanismsuntil apatch is available.


Intuitively, introducing more request types helps make the prediction more precise for each request, because processing timevaries for different kinds of requests.

the leakage bound is proportional to the number of request types.


In addition, random timehopping (TH) or direct sequence (DS) codes are used to spread spectrum [4].

the performance of UWB systems is decreased by contains delay and multiple access interference (MAI).


This figure is much higher than the percentage observed by Nali and Thorpe (30%) [8].

only 5 out of 10 (50%) secrets in the BDAS group possessed global symmetry.


Multicast security [14] aims to address the con.dentiality of content sharing with dynamic user groups.

conventional multicast and broadcast involve only two types of entities: multicast/broadcast center and users.


Second, the employees are not informed about the penetration test unless it deemed necessary.

the trust between the custodian and the contact person is shaken.


As one of the most fundamental security services, pairwise key establishment enables the sensor nodes to communicate securely with each other using cryptographic techniques.

due to the resource constraints on sensor nodes, it is not feasible for sensors to use traditional pairwise key establishment techniques such as public key cryptography and key distribution center (KDC).


One notable research e.ort in this direction is Flicker [20], which is a system that uses the late launch capability to run a secure veri.able workload.

the late launch capability, provided by both Intel [11] and AMD [1], incurs signi.cant overhead (in the magnitude of hundreds of milliseconds) on every context switch to the isolated environment.


Similar to them, we track taint information at the character level and use a syntax-aware evaluation to examine tainted input.

our approach differs from theirs in several important aspects.


[15] utilized a similar Flush-Reload side channel (a special case of our NFA-based framework) in a cross-VM context to break AES keys.

to the best of our knowledge, memory deduplication across VMs is not commonly used in many IaaS clouds (e.g., EC2), which limits the applicability of the Flush-Reload side-channel attack in those settings.


Web services are available for banking, shopping, learning, healthcare, and Government Online.

most of these services require a consumer s personal information in one form or another, leading to concerns over privacy.


$" Our implementation of Shot was written for and tested on Motorola DROID smartphones with Android version 2.2.

the system can be ported to any mobile phone with a vibration function and accelerometer.


China jinli71@gmail.com Duncan S. Wong Department of Computer Science, City University of Hong Kong, Hong Kong duncan@cityu.edu.hk ABSTRACT Attribute-based encryption (ABE) has been widely studied recently to support .ne-grained access control of shared data.

anonymous ABE, which is a relevant notion to ABE, further hides the receivers attribute information in ciphertexts because many attributes are sensitive and related to the identity of eligible user s. in existing anonymous ABE work, a user knows whether the attributes and the policy match or not only after repeating decryption attempts.


Battista Biggio Università di Cagliari Piazza d Armi 09123, Cagliari, Italy battista.biggio@diee.unica.it Davide Ariu Università di Cagliari Piazza d Armi 09123, Cagliari, Italy  davide.ariu@diee.unica.it Ignazio Pillai Università di Cagliari Piazza d Armi 09123, Cagliari, Italy pillai@diee.unica.it Marcello Pelillo Università Ca Foscari di Venezia Via Torino, 155 30172 Venezia-Mestre pelillo@dais.unive.it Samuel Rota Bulò FBK-irst Via Sommarive, 18 38123, Trento, Italy  rotabulo@fbk.eu Fabio Roli Università di Cagliari Piazza d Armi 09123, Cagliari, Italy  roli@diee.unica.it ABSTRACT Clustering algorithms have been increasingly adopted in security applications to spot dangerous or illicit activities.

they have not been originally devised to deal with deliberate attack attempts that may aim to subvert the clustering process itself.


Recall from section2 that once a subject joins the group, authorization information such as subject join time and object add time are available instantaneously to the TRM subject join time is provisioned at the TRM on successful join andobjectaddtimeisavailable via superdistribution.

subject leave time and object remove time are only available at refresh times from the CC.


eMMA6.LetS1,...,S1beasequeneofrandomvariablessuhthatforeveryjwehaveISjI:a(forsome a?0)andP1,, =P-1,,Then,forevery TE[0.5,1), - () m 1(H(T)-1)+1 PSj?Tla:2,(35) j=1 whereH(T):=-Tlog2T-(1-T)log2(1-T)isthebinary entropyfuntion ThislemmaisinomparablewithLemma8.Ononehand itisweakersineitappliesonlywhen(26)issatisfedand forT?1i2(also,forTnotmuhgreaterthan1i2itgives aworsebound).forourpurposes(Tloseto1)it isstrongerthanLemma8.


Figure 1: Artifacts of the WebID Identi.cation Approach: Certi.cate, URI, and Pro.le Command line tools like OpenSSL1 and keytool 2 enable users to create a WebID certi.cate fast and securely.

these tools are primarily intended for technically experienced computer users that are familiar with using command line interfaces.


Host Shutdown: If the host is compromised and cannot be protected by the methods mentioned above, shutting down the host action is implemented as the last mechanism to protect hardware against exploits.

time to restart the host is very long, which a.ects the availability of resources.


In Table 4, acceleration by gravity is almost the same as the synthetic vector of Y and Z.

the value of average of Y is larger than that of X or Z.


S, ideally one would like to have a function f : S .

c that directly outputs the correct classi.cation for s. this may not bepossible in practice.


An intuitive means for a system administrator to resolve policy con.icts is to remove all con.icts by modifying the con.icting rules.

changing the con.icting rules is signi.cantly dif.cult, even impossible, in practice from many aspects.


Furthermore, the mutual authentication version of AuthA method takes one and a half round trip.

in practice, it takes two full round trips, as the client s call to the service has to be returned, even with an empty envelope for the last message.


The Trusted Computing Group has standardized Trusted Platform Modules (TPMs) that are built into an increasing number of computers and could greatly harden usage controls against circumvention.

existing operating systems support TPMs only partially.


One exception is iOS, which prompts on requests for access to the user s location and, in the recent version, on requests for the user s contacts as well.

beyond these two data types, users have no options to limit when and how often, data will be accessed once the application is installed.


can be embedded and transmitted out of the networks via RTP streams.

since LSB-based covert channels are easily detectable and have poor immunity to manipulation, the LSB-based methods have never been a serious threat.


4) EARDet s performance is independent of the input traf.c, because the error rate is always zero.

to keep the same false positive rate, multistage .lters require more stages as the number of active .ows increases.


Logging mechanisms can provide a means for forensic analysis of user activity in software systems by proving that a user performed certain actions in the system.

logging mechanisms often inconsistently capture user interactions with sensitive data, creating gaps in traces of user activity.


From a mathematical point of view, the employed encryption algorithms, e.g., AES or 3DES, are highly secure.

recently it has been shown that the bitstream encryption feature of several FPGA product lines is susceptible to side-channel attacks that monitor the power consumption of the cryptographic module.


When c receives ; m1, every value for nonce N and for the claimed sender D is ; possible, and the answer m2 that c sends depends on these two variables.

when d receives m2, it must be encrypted for d and contain the nonce n sent earlier.


We were able to identify whether or not a sentence contained an ACR at an average rate around one sentence per 9 seconds.

this identification process is just making a simple yes or no decision and we had optimized an interface such that the user onlyhad to press a single button per sentence.


While they have the added developmental complexity of having to deal with writing the SMM handler in legacy 16 bit assembly, they expend little effort to conceal their memory footprint as the chipset handles the memory access redirection once SMRAM has been closed and locked by the handler.

in order to provide similar stealth, a VMBR will likely have a larger code footprint.


Therefore, it is possible to explore letter transitions not present in the training set.

out of 256 x 256, or 64K possible extended ASCII character transitions, only 18% of edges are used in our training set.


As such, it does not add or detract from the candidate attribute requirements for the role.

it can be .agged as a object that may not belong to the role since it does not appear to be semantically related.


since the communication between p and A has a de.nite length (either the length of the request, or the nonce or the HMAC), exploiting a bu.er over.ow is avoided by verifying the string length.


The TVM based semantic attestation mechanism enables the remote attestation of high-level program properties.

they only introduced the framework and did not clearly spell out the methods to e.ectively attest a remote program to guarantee its behaviors.


This paper talks that the remaining registry values from uninstalled programs should be investigated by examiner.

it is not easy for forensic examiners to check out a number of remaining registry values manually, so we are considering some ways to find these remainder values automatically.


One solution is to give priority to ACK messages and other tra.c may be discarded if necessary.

the adversaries may still be able to launch Denial-of-Service attacks with bogus ACK messages because verifying the authenticity of an ACK message is a non-trivial operation.


For example, spyware/adware programs record users sur.ng habits and send this private information to third parties.

benign BHOs (i.e., Browser Helper Objects) may access this information but will not send it out.


Moreover, although as discussed above the specific allegations about messages that Moldow edited (to remove profanity and delete offensive statements) reveal conduct that is plainly protected by section 230, the complaint makes general allegations that Moldow participates in the editing of messages; it is possible for an editor to be so closely involved in the creation of content that he becomes liable as an information provider.

new Jersey law also requires a defamation plaintiff to make very allegations that are sufficiently specific to identify the defamatory words, their utterer, and the facts and circumstances of their publication; general allegations that a defendant published defamatory matter are simply not sufficient to withstand a motion to dismiss.


If the risk in each certi.cate chain is quanti.ed, how can this quanti.ed risk be used for certi.cation path construction?

the authentication of Dan s identity is not suf.cient for Alice to trust Dan as an expert in epidemiology.


Senders can successively query for receipts to determine which remailer to blame for delivery failure.

a remailer might refuse to provide a receipt for a particular message either because it failed to send the message, or because it was unable to obtain a receipt from the next hop.


As an alternative to these third party infrastructures, peer to peer solutions have been developed, which require the participation of at least k peers to ensure the requirement of k-anonymity is satis.ed [13, 17].

it is not always possible to rely on other users of the service.


RELATEDWORK In terms of integrity-checking and authentication, digital signature in conventional public key infrastructure (PKI) [7] is a well accepted choice.

requiring a vehicle to verify the PKI signatures of other vehicles by itself as in works like [9] induces two problems as mentioned in [12].


3.3 Policy Composition and AnomalyAnalysis The access control policies in our model can be uniformly speci.ed both at the EHR-instance level within di.erent origin domains and at the aggregation level within a virtual composite EHR.

bringing in both positive and negative policies raises problems of possible con.icts, and the .exibility in data selection may result in issues of policy overlap.


In the previous section, 512 entries per hash table (h) with the substring length (k) of 5 and 7 bytes showed the best performance in Table 1: Block Select Memory Con.guration for XC2VP70 Number of Entry (h) 512 1K 2K 4K 8K 16K Single Block Width in bits 36 9 2 18 4 Table 2: Performance Comparison of Pattern Matching Techniques Description Input Device Throughput Logic Cells Bits (Gbps) / Char State Tables[4] 64 Altera 10.1 15 EP20k400E Pre-decoded CAMs [15] 32 Virtex2 6000 9.7 3.56 Granidt [14] 32 VirtexE 1000 2.2 15.2 Parallel Comparators [6] 32 Altera EP20K 2.9 10.6 TBT 32 VirtexII Pro 2.0 terms of the memory consumption and utilization.

implementing both 5 and 7 bytes wide hash tables requires two memory blocks in parallel, since the single block width of XC2VP70 with 512 entries is 4.5 bytes as shown in Table 1.


none of these existing schemes can efficiently protect the user s privacy leakage via privilege escalation attacks.


Finally, some schemes [26] require all parties to agree on the same public parameters, such as the common discrete log group, which makes any changes to the security parameter or signcryption scheme quite dif.cult.

we observe that practical signature and encryption schemes such as OAEP [4], OAEP+ [25], and PSS-R [5], are built from trapdoor permutations (TDPs) such as RSA, and are analyzed in the random oracle (RO) model.


These readings are, as a norm, primitive types such as integers, longs and .oats, or small collections of primitive types.

larger, compound data values are sometimes needed and thus they are supported.


For example, in the above code, the outermost AC tag maps the objects inside its scope to ring 2 (ring=2).

only principals in ring 0 can modify any DOM elements embedded inside the outermost AC tags (w=0).


Obviously, B3 is much better than B2 since the aim of B2 is to maximum the system throughput without considering saving the transmission power.

the transmission power of B1 achieves a smaller value on average than B3 does.


Unlike the traditional command and control communication over a centralized infrastructure (such as a cellular network), out-of-band communication is very hard to detect and even harder to prevent.

it can be still be used to reach out to a large population of infected mobile bots.


Anomalybased systems are used todetect unknown attacks,but usuallygeneratefalsepositives[8,42].

signature-basedsystems are typically moreprecise,but cannot detect attacksfor which theydo 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 madeordistributedforpro.t or commercial advantage and that copies bearthisnoticeand thefull citation onthe .rstpage.Tocopy otherwise,to republish, topost on servers or to redistribute tolists, requiresprior speci.c permissionand/or afee.


In what may seem counterintuitive, for lift = 45, the random distribution outperforms the empirical one.

this is expected behavior: as a consequence of somepairs correlating well(i.e., at lift = 60), theinverse should alsohold(i.e., somepairs correlate worse than random).


At the end of the study, 90 PINs and 90 gesture passwords were entered.

two entries of gesture passwords were discarded due to difficulties (after three attempts with each of those passwords, the users still failed to enter the gestures correctly).


In a related work, [17, 18] use multiple implicit factors (from user context) to determine how to explicitly authenticate a user.

our work is di.erent from these approaches since in addition to allowing an app developer to selectively invoke an authenticating module based on the type of an app, we delegate IA tasks to an app and not to the device.


Thus, the process of reproducing identical results, without having access to the datasets, is di.cult to be achieved.

since the URL sources used in this study represent the browsing patterns of a wide range of users, the chances of having special cases in the dataset is likely to be low, and similar results should be reproduced with other URL datasets if a similar solution is recreated as described in this paper.


The signal handler overhead experiences the most kernel overhead, with the majority of the extra instructions executed occurring on the kernel side.Because the signal is delivered while the application is in a compartment, the kernel must use the longer XOM save routines shown in Figure 2 to save every register.In addition, when the kernel populates the sigcontext structure, the kernel requires more instructions to copy the larger encrypted register values.The additional instructions and larger data structures also result in an increase in cache misses.

finally, the xom fork benchmark actually has negative overhead.Fork is already a long operation in IRIX, so the overhead imposed by XOM negligible.The majority of the extra instructions in fork are actually due to the extra xom alloc() system call that is used to allocate a new Register Key Table entry.in this case more favorable behavior in the L1 cache makes up for the additional instructions and L2 cache misses.


We believe such a design is insecure because OSes have large TCBs and cannot offer code integrity and data con.dentiality.

more secure designs have been proposed; some rely on hypervisors[27, 13, 36] to offer code integrity and data con.dentiality, whereas others rely on secure co-processors[14].


In any case, our proposed authentication scheme does not prevent a victim from accessing the phishing page.

6http://www.chromium.org/sts  the information the phisher can obtain is not su.cient to abuse the user s account because the web application denies access if no valid response is appended to the login request.


A naïve approach would be to associate each pseudonym with a randomly generated IP addresses in the network and route based on IP addresses within the ISP.

this approach requires routers to maintain routing tables that are proportional to the number of actively used pseudonyms, with the random address allocation preventing the use of aggregation of routing table entries.


A naive idea would be adding yet another permission to Android s already complex permission system and have any data monitoring app requesting this permission in AndroidManifest.xml.

prior research shows that the users do not pay too much attention to the permission list when installing apps, and the developers tend to declare more permissions than needed [25].


Adding some distinctive data in the module data structure is a natural and direct way to import signatures.

this way is not robust enough to counter evasion attacks.


5.1 Correctness Client-side XSS .lters do not require perfect correctness to be useful.

the usefulness of a .lter depends what percent of vulnerabilities the .lter covers and the rate of false positives and false negatives.


The key updating mechanism may require decrypting all the data with the old keys and re-encrypting it using the new keys.

this approach is not practical, particularly when data sets are large.


Our results suggest that when the amount of A-hierarchy relations is greater than the other two types of hierarchical relations, the two heuristics behave similarly.

when the proportions are di.erent, the max perm heuristic is consistently faster than the min risk heuristic.


Note thatour concrete constructionhas twodi.erentidenti.ersforagiven .le: theciphertextfor a .leisstored under a .le pointer that is revealed during the search operation, butthe .leinformationintheindexisstoredin Td under the output of a pseudo-random function on the .le.

the scheme s operations immediately reveal to an adversary the correlation between these values, so in our leakage description, we do not distinguish between these two types of .le identi.ers.


Also, methods have been developed to compute attack graphs [3], which generate a sequence of adversary actions that may result in host compromise.

these methods treat programs as black boxes, where any program entry point may be able to access either adversary-controlled data or benign data.


PGBC results in a larger number of clients participating in proactive group defense, roughly 20% more than WRL allows this is one of the reasons why PGBC keeps the infection level so small in the network.

when proactive group defense is applied, the affected messages are delayed by an amount equal to the PGBC backoff timer, T .


When underlying physical, psychic or social mechanisms are known, more precise models, with additional variables, may be developed for speci.c cases (e.g., wind and power lines).

the goal here is a general model that can be used for any type of threat.


If we fix the value of b, the value of n may become very large in some frames or very small in other ones, since the length L varies for each frame.

a too large value of n causes a larger computation overhead when exchanging the blocks.


It prevents compilers from moving comparisons away from their corresponding branching instructions.

our approach allows instruction scheduling within basic blocks.


For example, Microsofts Royalty-Free Sender ID Patent License Agreement terms were a barrier to any Linux Debian package that wished to implement Sender ID or include Sender ID support [5].

microsoft changed the licence terms of relevant patents to the Microsoft Open Speci.cation Promise, which is widely seen to be compatible to the GPL [12].


CONCLUSIONS urses [22] argues that even though we cannot engineer society, we can engineer systems that address privacy concerns.

the way how privacy is addressed in IT systems makes a di.erence.


One effort to address this is the Facebook veri.ed application program, which attempts to authenticate and verify applications for proper data access by hand [14].

just two malicious or compromised users can launch a client-side attack passively with minimal start-up costs, and is much more dif.cult to detect.


As such, they can be shown to 3-wise independent but not 4-wise independent, e.g., 1212 1212 z1,1z2,2 =(x )(x )=(x )(x )= z1,2z2,1 .

1x12x21x22x1 by exploiting the geometry of the dependencies, the next lemma establishes that the elements of z are still su.ciently independent.


Because of their massive parallelism and computational power, in recent years GPUs have been considered a viable platform for this application.

existing work has mostly evaluated specific solutions on small datasets consisting of a few tens of patterns, which are far behind today s applications with typically thousands of rules.


Since this process is computationally hard, some authors were misled to believe that their construction is secure .

these constructions are not provably secure.


[39] Coffee suppliers respond to this demand, or perhaps also from a shared sense of doing the right thing.

in reality, we do not see companies using their privacy policies as differentiators; nor do we see consumers turning away from companies with privacy-invasive policies in droves.


Therefore, actual media access is not carried out up to 512 KB.

a 10 MB read does not demonstrate an overhead for the BitVisor core or +ATA Driver because the overhead is hidden by slow media access.


This latter process is closely related to label management in mandatory access control systems.

because of policy semantics and form, PinUP policy tracking requires different machinery.


A discounting learning algorithm has been used in the Smart Sifter prototype [32], and should combine a smooth running time with good detection rates.

it lacks reports of real world experimentation.


Nevertheless, such isolation improves the overall system s security because an exploit within one container only compromises the data exposed within that container, rather than leading to a system-wide compromise [8, 37].

disaggregation only limits the impact of security vulnerabilities, it does not reduce the size of the TCB nor the number of vulnerabilities.


AdSplit [10], AdDroid [11] and SanAdBox [12] provide ad library security protection techniques.

these works do not capture incoming malicious ads.


To lower the risks involved, proper risk management needs to be put in place.

existing ICT-related risk management processes are not directly applicable to the smart grid domain as the technology and the security requirements are signi.cantly di.erent.


Another solution is to issue a special certi.cates for each genuine site (as accepted by the vendors of anti-phishing products).

it is completely closed solution with unclear criteria for genuineness .


In particular, if the inter-packet delay, in arriving tra.c, is large enough, to allow the receiving host to process each packet before the arrival of a new one, then, even a large burst may not introduce signi.cant delays into the tra.c .ow.

a 2 Notice that since all our communication is within the cloud boundaries, no charges apply on the attacker.


The scenario comprisestwo parties: Alice,who hasapoint a = i=0 , {ai}N-1 and Bob, who has the description of the region S. Alice wants to check if a .S, without disclosing any knowledge of the coordinates of a to Bob, and without getting any knowledge of the description of S. The clear-text algorithm for solving the posed problem consistsinchecking thepositionof thepointwithrespectto each of the hyperplanes: if a .Sm,.m =1,...,K, which canbe checkedby computing the inner productbetween the point and the normal vector of each plane and adding the corresponding o.sets, then thepoint lies inside S. The time e.ciency of this algorithm can be optimized: once a hyperplane that leaves thepoint outsideof thebounded regionis found, the algorithm stops without computing the remaining scalar products (in such a case, this algorithm is the most e.cient one also for the two-dimensional point inclusion problem in convex polygons of small area).

a direct implementation of this stop-test is notpossible in our scenario, as it would leak too much information about the position of the point w.r.t.


This is a great bene.t in situations such as the power grid, wherein a single provider many want to talk with hundreds of clients at a given time, and have a reasonable response time.

in terms of time of creation, zone installation time was unacceptably long.


The most common data anonymization technique is k-anonymity [20], it is also used in location anonymization [10] along with some variants [3], where is known as cloaking: here Charlie is provided with k possible Alice s locations including the true location so that, when there is no further information available to Charlie, the probability he can associate Alice to a speci.c location is 1/k (Alice s location is said to be k-anonymous).

as already note in [4] and [9], if Charlie knows that the landscape is not neutral, so that some user locations are more likely than others (e.g.


0.5 iteration, because an erroneous frame is not worth either deinterleaving or decoding.

the mean absolute LLR starts with a similar value for each frame.


SVM treats each data instance (i.e., trip) to be independent and tries to classify it as a user or sybil trip based on the attribute values.

there is an additional restriction in our scenario that states that only one user trip can exist in a set of k trips reported to the LBS at one given time (because k-1 trips are sybil trips).


On one hand, stability of the permission speci.cation is desirable as it means that application developers do not need to update the permissions their applications declare as the underlying OS changes.

.ne-grain permissions provide better least-privilege protection.


Finally, we chose SRP because it can be used without any licensing, has no known .aws in its current implementation and is already included in other cryptographic protocols such as TLS [35].

one disadvantage of this protocol is the high complexity of computations due to modulo operations on big numbers.


Key material that is marked non extractable should have some kind of user interaction authorization when importing/exporting (within the same-origin), and access to secret key material should be forbidden.

keys that are not marked explicitly as private, secret, or as non-extractable will be accessible to the server with same-origin policy if key export is done.


Anomaly detection algorithms and corresponding tools were also introduced by [6, 29].

prior work only treated a policy con.ict as an inconsistent relation between one rule and other rules.


The proxy has no idea about the signed messages.

he/she can check whether the partial signature is on a speci.c message or not by (a+H1 (Y ||A||b ' )·y)+Sb ' ?


This is due to the fact that almost all the mesh nodes can compute their private keys for those threshold values.

as we increase threshold value, some of the nodes cannot compute their private keys and they use the timeout method described in Section 3.5.


Atomicity: Suppose the system starts in a bad state: 0, 1, 0.

measurementmight read the.rstbit, after which the attacker could switch state to 1, 0, 0, and measurement will see 0, 0, 0 and the state is considered valid.


Also, Sketcha[3] was proposed for the user to rotate several images until it is upright, where each image is automatically rendered from a 3D model using a randomized view point.

sketcha does not utilize the text information, relying only on images and a simple upright rotation puzzle.


We showed in [20] that HCPN-based alert correlation can significantly reduce both the total number of alerts and the number of false alarms.

we also determined that alert confidence fusion is needed to address the different reliability of alerts from alert analyzers, particularly when these are installed at different sites, which is a typical scenario.