sadat2307/MSciNLI huggingface dataset:
Domain: Security and privacy
Sentence 1: (Accountable entity) An entity is accountable with respect to some policy (or accountable for obeying the policy) if, whenever the entity violates the pol­icy, then with some non-zero probability it is, or could be, punished.
Sentence 2: we want to explicitly allow for the possibility that there is not another entity that hold[s the violator] .
Relationship: entailment
Domain: Security and privacy
Sentence 1: EP;s ::= evaluation context P;s hole let x =EP;s in b sequential evaluation EP;s r b fork left a r EP;s fork right (.x/µ@P ' )EP;{x/µ@P'}.s explicit substitution [P ' ]EP';s (P ' P) lowering of process label Evaluation can proceed sequentially inside let processes, and in parallel under forks [25]; it can also proceed under explicit sub­stitutions and lowering of process labels.
Sentence 2: note how evaluation contextsbuild substitution environments fromexplicit substitutions,and labelsfrom changesof process labels.Wedenote by EP;sAa]P ' ;s ' the process obtainedby plugging the hole P ' ;s ' in EP;s with a.
Relationship: entailment
Domain: Security and privacy
Sentence 1: IMPLEMENTATION As part of the WILMA Project [12], a number of hotspots have been deployed in the town of Trento by project par­ticipants.
Sentence 2: the University of Trento has fully covered its Science Faculty building with 20 access points, while Alpikom (a regional telecommunications operator) has connected an equal number of access points to a network of streetlight poles in one of the most populated areas of the town.
Relationship: entailment
Domain: Security and privacy
Sentence 1: Let S be the set of SNPs that are exposed to the MC as a result of Test 1 at time t. With this proposed policy, the MC can keep these SNPs in its database only until time t+t.
Sentence 2: an attacker (who hacks into the MC s database) or a disgruntled employee, who happens to access MC s database sometime between time t and t + t, can use the SNPs in S to infer other non-exposed SNPs (via the LD relationships) of the patient.
Relationship: entailment
Domain: Security and privacy
Sentence 1: 3.1.2 Pattern Variables MOPS is control .ow and path sensitive but data .ow insensitive.
Sentence 2: we ignore most data .ow: for instance, when processing an if-then-else statement, we conservatively assume that either branch could be taken, and we do not try to analyze whether the condition to the if statement is true or not.
Relationship: entailment
Domain: Security and privacy
Sentence 1: If cast in the CK-framework for generality, we can consider any CMIM adversary A as speci.ed in the CK-framework but with the following limitation: all the DH-components exchanged in sessions between the pair of uncorrupted play­ers A and B are honestly generated by themselves respec­ tively.
Sentence 2: any session ( B, X, Y )has the A, matching session ( A, Y , X ) with matching player roles, B, and vice versa.
Relationship: entailment
Domain: Security and privacy
Sentence 1: = 1] Experiment 1 In this experiment we modify the way the chal­lenger constructs the challenge ciphertext.
Sentence 2: it con­structs the challenge ciphertext as jNs jjNs C = (((1+N)mf )·(r1), ((1+N)mf )·(r2)) (mod Ns+1) where both r1 and r2 are random elements from QR(N).
Relationship: entailment
Domain: Security and privacy
Sentence 1: Later studies [16, 17, 20, 32, 33] show that the false data injection attacks can lead to increased system op­eration costs due to inordinate generation dispatch [33] or energy routing [20], as well as economic losses due to mis­conduct of electricity markets [16, 17, 32].
Sentence 2: the studies in [16, 17, 32] focus on false data injection attacks on real-time wholesale markets.
Relationship: entailment
Domain: Security and privacy
Sentence 1: This should be compared with the corresponding error of 17.1~0 for the original data (without any transformations for anonymity).
Sentence 2: the classification er- rors are significantly higher for the data sets produced by optimizing the LM metric and reach the maximum possi- ble value at higher values of k. for k values of 200 and above the classifiers generated using data from experiment 2 misclassify all the minority class records.
Relationship: entailment
Domain: Security and privacy
Sentence 1: Muhammad Awais Shibli National University of Sciences and Technology Islamabad Pakistan awais.shibli @seecs.edu.pk  at abstract level keeping the underlying platform and vir­tual infrastructure hidden from the customer.
Sentence 2: similarly, d is the disbelief about truth of proposition that is derived from the negative feedback sub­mitted by the user about CSP.
Relationship: neutral
Domain: Security and privacy
Sentence 1: bj is the best action that the agent can take if the state of the world is sj then the expected value of perfect information is p.·b -max p.·v.i i this is an upper limit on the total value of all possible utterances with respect to the application of criterion c. Utilitarian measures of information are expressed in terms of: if you know information x when applying criterion y to determine which action to perform then you will gain utility z over not knowing x [26].
Sentence 2: the LOGIC frame­work for argumentative negotiation [27] is based on .ve categories: Legitimacy of the arguments, Options i.e.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Francisco Martín-Fernández, Department of Computer Science, University of La Laguna, Tenerife, Spain, Phone: +34 922 318 176, .-mail: francisco.martin.07@edu.ull.es.
Sentence 2: on the one hand, like the sponge construction of SHA-3, our proposal based on a duplex construction also uses Keccak as fixed-length transformation f, the same padding rule based on the 10*1 pattern, and data bit rate r. unlike a sponge function, the duplex construction output corresponding to an input string might be obtained through the concatenation of the outputs resulting from successive input blocks (see Figure 2).
Relationship: neutral
Domain: Security and privacy
Sentence 1: 2.3.4 Availability Data transmission over ad-hoc wireless and sensor net­works as well as unprotected radio-frequency identi.cation (RFID) tags are known to be vulnerable to active attacks such as tra.c analysis, spoo.ng and denial of service [28, 27].
Sentence 2: for clarity, we use a yellow-lightning symbol on the corner of the light cloud icon to represent security-related and privacy-related softgoals, thus di.er­entiating them from other softgoals such as Ubiquity and Safety.
Relationship: neutral
Domain: Security and privacy
Sentence 1: When a batch operation is executed, the transformed program uses the computed index array together with the start address of each array operand and the array being updated to perform computation.
Sentence 2: recall that we support two ways for the programmer to specify that portions of the code can be pro­cessed concurrently: (1) parallel loop iterations and (2) arbitrary parts of code that can be processed simultaneously.
Relationship: neutral
Domain: Security and privacy
Sentence 1: VT 1:K Af 2 Next, we restrict our focus to tra.c processes that gener­ate spherical k-rank link tra.c covariance matrices3.This property implies that the eigen-spectrum consists of K ones followed by all zeroes.
Sentence 2: however with an­tidote and the heavier poisoning strategies, we see that the evasion success actually starts to decrease after some time.
Relationship: neutral
Domain: Security and privacy
Sentence 1: At the same time, isolation is achieved by putting the monitor code along with its private data in a separate  Figure 1: (a) In-VM and (b) Out-of-VM monitoring hypervisor protected guest address space that can only be entered and exited through specially constructed protected gates.
Sentence 2: in virtual machines, the page tables in the guest VM are not used for translating virtual addresses to physical addresses because the physical memory that needs to be translated to is on the host, which is maintained and shared among various VM s by the hypervisor.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In Proceedings of the 6th ACM Symposium on Access ControlModelsandTechnologies(SACMAT 01), pages 10 20, 2001.
Sentence 2: if the system were based on GPS, for instance, the server could not dis­tinguishbetweenadevicethat reported thetruecoordinates and a corrupted device that provided false locations.
Relationship: neutral
Domain: Security and privacy
Sentence 1: However, it means that the random sequence of m1, , mJ cannot decrypt uniquely, therefore the alternative equivalent small sequence m 1,, m J which is satisfied SJi=1 mi bi =SJi=1 m i bi and SJi=1 mi di =SJi=1 m i di is exist .
Sentence 2: this lattice is composed with the public key and the cipher-text.
Relationship: neutral
Domain: Security and privacy
Sentence 1: 2.2.2 Shortcomings for the Web Service Consumer Application needs to know and store the User Policy, which will act over the multiple User Identity Data items to provide a personalized experience to the User  User Data 1 IdP Data Service 1  Figure 3: Application/SP is forced to know and store user-policies/rules, which will act over multi­ple user data items from di.erent Identity Services The primary goal of any SP is to provide a good and satisfying user experience.
Sentence 2: this user-action results in an linkCreate message, which may pig­gyback on a AuthnRequest message, since there is no exist­ing federation for the user.
Relationship: neutral
Domain: Security and privacy
Sentence 1: When more technical details of a vulnerability become available, its exploitability or severity may need to be adjusted; when patches are released by vendors to counter an exploit, the vulnerability may become less severe; on the other hand, when exploit codes become more widely spread, the severity of a vulnerability may increase.
Sentence 2: the goal here is to update the Temporal Metric values for maintaining the CVSS databases.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Since it is assembled in advance, and networks constantly change, the list is likely to be more-or-less out of date by the time of use.
Sentence 2: for single packet UDP worms, the hitlist will be in .ight before anything is known about the need for it, so there, K-way trees increase total bandwidth demand by a factor of K. Likewise, the multitree approach does not slow the worm.
Relationship: neutral
Domain: Security and privacy
Sentence 1: We show that by using these equivalence relations the size of a mediator placement problem is dependent on the number of unique host con.gurations, not the num­ber of hosts.
Sentence 2: 4.5 Leveraging Network Mediation Merging individual HIFMs based on .ow equivalence pro­vides the potential for the greatest reduction of the three relations, but it does not take into account the protection that can be provided by the network nodes on paths to hosts.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Finally, one has to be willing to go all the way to the deployment of the protocol it took two years of work from the publication of the protocol until the .nalization of the tests, and more e.ort is needed before the protocols can be used in an industry standard.
Sentence 2: a triv­ial solution to this end would be to use only devices on the consumer side to provide this information, and thus keep all energy information localized.
Relationship: neutral
Domain: Security and privacy
Sentence 1: ASIACCS 11, March 22-24, 2011, HongKong, China Copyright 2011ACM 978-1-4503-0564-8/11/03 ...$10.00.
Sentence 2: ),g iii 2 r For the update time t, select ßt - Zp .and publish the update information as .
Relationship: neutral
Domain: Security and privacy
Sentence 1: PROXIMITY INDEX CALCULATION Let tG, tI , tM , tN represent the thresholds of the four families of metamorphic virus engines G2, IL SMG, MPC-GEN and NGVCK.
Sentence 2: once the viruses executed on the emulator have corruptedtheOS environment(on the emulator), the emula­tor can be started from the previous uncorrupted snapshot.
Relationship: neutral
Domain: Security and privacy
Sentence 1: For example, should the system predict that Bob will access Alice s o.ce, past observations may show that Alice s .rst access required the department to recon.gure policy.
Sentence 2: as such, our techniques should apply to sys­tems employing a wide variety of access-control frameworks, such asRBAC[22],SPKI/SDSI[21],RT[19], orPCA[3].
Relationship: neutral
Domain: Security and privacy
Sentence 1: ThenfromEquations(3),(4),(5) F,{id} we have A AA Pr[G0 ]= 2d(F)+Pr[H]+Pr[Bad(H)].
Sentence 2: the amortized cost of StE.,a is the same as that of E. Weremark thatthesituationhereisanalogous tothat ofXEX[18].
Relationship: neutral
Domain: Security and privacy
Sentence 1: In this experiment, we start from the same seed set of N identi.ed criminal ac­counts, which are randomly selected from 2,060 identi.ed criminal accounts.
Sentence 2: accord­ ing to Twitter Rules [8], a Twitter account can be consid­ ered to be spamming, and thus be suspended by Twitter, if it has a small number of followers compared to the amount of accounts that it follows.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In a naive approach, A and B would engage in an SMC protocol that takes as input sets T and V , and privately evaluates the decision rule DR on all record pairs of the Cartesian product T ×V .
Sentence 2: speci.cally, we will focus on extend­ing security/privacy de.nitions given for the semi-honest model to our hybrid framework where each party also reveals some sanitized information about its data.2 The basic semi-honest behavior de.nition [14] states that a com­putation is secure if the view of the dishonest parties (combined view, as dishonest parties may collude) during the execution of the protocol can be effectively simulated knowing only the input and the output of the dishonest parties.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In particular for uncompressed audio files we use the algorithm proposed in [7] which uses the peak point extraction scheme for synchronization and the watermark is repeatedly embedded in the DCT domain.
Sentence 2: in order to solve these problems we suggest to create and use semantic watermarks that (i) represent a certain combinatorial object with a specific characteristic known only to their creator and (ii) the characteristic known to their creator still holds for any part of the watermark (see [3] for an approach in image watermarking).
Relationship: neutral
Domain: Security and privacy
Sentence 1: Tracing attacks in the aforementioned classes uses the same set of performed actions that correspond to the tracing of processes activity and FAT modifcations at the system interacting with the GMS tracing application.
Sentence 2: rEFERENCES [1] BELENKY, A., AND ANSARI, N. IP Traceback with Deterministic Packet Marking.
Relationship: neutral
Domain: Security and privacy
Sentence 1: 9.3.1 Translating from MPEG-21 to OMA Since OMA DRM REL is much simpler than MPEG REL, there are many expressions in MPEG REL that cannot be translated into OMA DRM REL.
Sentence 2: we can see no way of ex­pressing the MPEG REL loan, extract, copy, etc.
Relationship: neutral
Domain: Security and privacy
Sentence 1: It is plausible that the difference between task completion times we observed were due to the fact that the new scheme requires only 4 digits to be entered into the phone, as opposed to 10 digits for EKO s scheme.
Sentence 2: unlike our system, there is no storage mechanism for nonces; instead each nonce is communicated by the server to the user right before authentication.
Relationship: neutral
Domain: Security and privacy
Sentence 1: http://preview.tinyurl.com/7ebpft9, 2012.
Sentence 2: we say that SPH-PSM guarantees Alice s pri­vacy if there exists a Probabilistic Polynomial Time (PPT) algorithm B* such that, given Bob s output b, the following holds: {B * (t, b)}((p,s),t) =c {V iewB((p, s), t)}((p,s),t) for all possible inputs, with the knowledge of the output bit b and Bob s input, B* can e.ciently simulate the view of Bob.
Relationship: neutral
Domain: Security and privacy
Sentence 1: they have the same gain) and let s de.ne k = Gt Gr K. If A and B transmit their packets with a power uniformly distributed between [St; St + 5] then A receives the packets from B with a power uni- H)k (St+ formly distributed between [ kSt ;].
Sentence 2: in this paper it is conjectured that an eaves­dropper cannot distinguish the source of the packets re­garding signal level difference (in scenario1).
Relationship: neutral
Domain: Security and privacy
Sentence 1: The Black-hole node 18 sends RREP to node S as a response to the RREQ with the highest sequence number (fresh route) and a hop-count of 1(shortest path).
Sentence 2: sAICSIT '13, October 07 -09 2013, East London, South Africa Copyright 2013 ACM 978-1-4503-2112-9/13/10 $15.00.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Fur­ther, being aware of the importance of DIFT, there are also efforts trying to implement general DIFT systems that are customizable to detect security exploits, analyze program behaviorandtesting[5,12].
Sentence 2: second, we plan to ex­tend and applySHIFT toanalyzemodern security exploits, generate accurate intrusion-prevention signatures, and de­tectpossibleinformationleakages.Third, asSHIFTiscur­rently implemented using a compiler and requires accesses to the source code, we plan to implement SHIFT using a binary translator and apply various dynamic optimization techniquestofurtherlowerits overhead.Finally, weintend to extendSHIFTfor multi-threaded applications andinves­tigate this extension sperformanceimplications.
Relationship: neutral
Domain: Security and privacy
Sentence 1: where .i is a range on the dimension i, for each 1 = i = d. Informally, a block represents a hyper-rectangular region of D. A block b of D with all zero elements is called a null block.
Sentence 2: gHBH (due to the larger number of buckets built in the same storage space, and to the di.erent criterion adopted to determine how to split buck­ets) manages to locate and partition dense regions by means of di.erent buckets.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Demo: Zero Interaction Private Messaging with ZIPR Ali Razeen Landon Cox Duke University Duke University alrazeen@cs.duke.edu lpcox@cs.duke.edu ABSTRACT Messaging app developers are beginning to take the security and privacy of their users communication more seriously [3].
Sentence 2: unlike HTTPS, the end-to-end encryption in ZIPR takes place between the two users carrying out a conversation and not between a server and a user.
Relationship: neutral
Domain: Security and privacy
Sentence 1: So far, lots of e.ort has been made on detection and defense of DDoS attacks.
Sentence 2: overall, only 16 predictions are much di.erent from the actual results, resulting a prediction average square Figure 5: Prediction of available service rates versus the actual results Table 1 shows the prediction accuracy against and the number of historical samples (N) and sample intervals (Dt) adopted in the prediction.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Their priority values are the same but the dynamic receivers got the SMS first before the static receivers although the static receivers have been installed first.
Sentence 2: in this case, the first one on the list of the table com.android.mms.transaction.PrivilegedSmsReceiver which is a receiver of the native SMS app will be located on the bottom of the list due to its low priority value, but we will change a position of the receiver of the native SMS app to the top of the list on the framework layer.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Two users will only be able to establish a rela­tionship in the social network if they know of, or are introduced to, each other.
Sentence 2: this attack can further be extended to monitoring: if the adversary exchanges keys with the .rst user pretending to be the second, and repeats this with the other user, the adversary can monitor all messages passed between users.
Relationship: neutral
Domain: Security and privacy
Sentence 1: {l0if Yt =lunch l0if zt =no plan r t =lif Yt =off rt = 0if zt =no plan0otherwise 6.2 Measure of effectiveness We consider the effectiveness of the presence inference engine in trust management applications.
Sentence 2: if we would like to temporarily transfer our authorization to another person who works closely with us, we can implement a policy that allows both users to access a re­source if the con.dence value of their being in the same workspace is beyond a certain value.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Thus, we formulate the problem of emulating the malware sam­ple as constructing an emulator that behaves as the sample ex­pects with respect to the anti-emulation check, but is otherwise unchanged.
Sentence 2: after the return address is modi.ed, the execution of the malware sample in QEMU jumps to a position that does not appear to be reasonable code, and on the next instruction an exception is raised.
Relationship: neutral
Domain: Security and privacy
Sentence 1: First, the algorithmic techniques in prior work have as­sumed that administrators can wade through every potential con.guration change, either assigning costs to the changes a priori, or if they do not assign costs, rejecting a large number of proposed changes that are too high in cost (i.e., infeasible).
Sentence 2: running just Heat-ray s implementation of shortest path in the con.guration required by Young s algorithm (i.e., without sampling 1,000 starting nodes and 1,000 shortest path trees) would require over 4 orders of magnitude more running time, simply because many more nodes have to be visited in the graph.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Some of this new work is in progress, such as the Web Services Secure Exchange (WS-SX) work at OASIS.
Sentence 2: panel Directions and Trends of XML and Web Service Security Workshop Chairs: Panel Chair: Ernesto Damiani* Anne Anderson Alban Gabillon** Sun Microsystems, Inc. *University of Milan, Italy Burlington, MA USA **University of Pau, France Anne.Anderson@sun.com *damiani@dti.unimi.it **gabillon@univ-pau.fr David Staggs Bhavani Thuraisingham Marianne Winslett VA / HIA (SAIC), USA University of Texas at Dallas, USA University of Illinois at Urbana- Champaign, USA PANEL OVERVIEW This panel will allow open discussion among workshop participants and some invited panelists on all open issues related to XML web services security.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The second party may report the .rst party to authorities; alternatively, if the second party does not report the .rst party he runs the risk that the .rst party was testing him at the behest of authorities (and hence the .rst party s o.er was not genuine).
Sentence 2: we then considered su.cient well-formed conditions on the approvability graph to ensure that every task described by it can always complete.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The certificate chain contains the identification certificate of A1 (CertA1), issued by PSD controller A, and the PSD controller certificate A (cross-certificate CertPSDA), issued by MPSD controller C. The entity B1 trusts in C as Relaying Party (RP) of the MPSD.
Sentence 2: a main purpose of this work was developing a framework that addresses all these issues.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In 8th Workshop on Hot Topics in Operating Systems (Ho­tOS), pages 133 138, May 2001.
Sentence 2: proxos pro­tects the security-sensitive application and its data while at the same time allowing the application to interact with other commodity ap­plications by having the security-sensitive application declare the interface it can safely export to other applications through a set of system call routing rules.
Relationship: neutral