sadat2307/MSciNLI huggingface dataset:
Domain: Security and privacy
Sentence 1: Finally, by preventing recursive calls to SENTER, we prevent Aos from executing a modi.ed MLE that uses SENTER to reset PCRs 17 23 and extend them with correct values.
Sentence 2: as long as the MLE does not modify its own code during execution, no other code that was not previ­ously measured by the ACM can execute within the secure environment (Property II).
Relationship: reasoning
Domain: Security and privacy
Sentence 1: This signi.cant increase comes from the mask path implementation necessary to operate the masking/unmasking operation, and specially the non-linear part [10].
Sentence 2: it is worthwhile to study masking counter­measures thwarting second-order DPA (2O-DPA) in particular, and high-order DPA (HO-DPA) in general, with a complexity increase almost negligible, or much less than a factor two.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: (Proof of Lemma 6) In order to show that decompose never returns failure, we need to show that ev­ery time it reaches Step 2(b)i, there exists two di.erent code­words u and w satisfying degGn (Au,w) > 10-3degGT (Au,w) .
Sentence 2: u,w Note that since we require a strict inequality, the above con­dition also implies Au,w = f. decompose always terminates in .nite time.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Rn, less than n constraints used to specify Q are active at x 0 [4]; we denote by d (d < n) the number of active constraints T in x 0 and denote them as ax 0 = bi, i = {j1, ..., jd}.
Sentence 2: i the vectors ai, i = j1, ..., jd belong to a proper subspace of Rn and there exists d .
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Assume, that F = {3, 4, 5} is a set of strings, where 3,4,5are the numbers of strings of the set B.
Sentence 2: we go through the elements of the string = 3, spotting if the element from the string meets in other strings of the set F and making sure, that the entries of the letter are situated only in the strings of F. to find the letter we are to go through all the elements of B for every letter.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: (/(tch + tsh)Thus we obtain ß = .
Sentence 2: (/(tch + tsh).on this extreme the advantage of the adversary relative to the honest solver, depends on the ratio between ., the lower bound on the (average) time it takes the adversary to compute the sequential hash function sh, and tsh+tch, the total time an honest party needs to eval­uate sh once and ch once (where ch is the collision-resistant hash function).
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Engineering Carleton University Carleton University Carleton University Ottawa, Canada deholo@ccsl.carleton.ca Ottawa, Canada paulv@scs.carleton.ca Ottawa, Canada adler@sce.carleton.ca ABSTRACT Identity fraud (IDF) may be de.ned informally as exploita­tion of credential information using some form of imper­sonation or misrepresentation of identity, in the context of transactions.
Sentence 2: iDF may be viewed as a combination of two old problems: user authentication and transaction au­thorization.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Alternatively, the attackers may attempt to change the code or data of the application in order to modify its behavior so that it leaks out its secret data.
Sentence 2: the goal of a secure comput­ing environment on untrusted computing node is to provide privacy (a guarantee that plaintext of code or data will not be leaked to the adversary) and integrity (a guarantee that program behavior or data cannot be modi.ed by the adver­sary).
Relationship: reasoning
Domain: Security and privacy
Sentence 1: We repeated our experiment 10 times for each value of m. The number of successes for 5 As only the virtual address of the handler was required to construct the attack NFA, we were able to perform the attack without studying the Zend source code.
Sentence 2: the name of the function, which is hidden in the result of an objdump, remains unknown to us.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: The ISN generation pattern for the RTU was then ana­ lyzed using a more generalized method by plotting the time between connection initiations versus the di.erence between the sequence numbers used in the two consecutive initia- Difference between consecutive ISNs 5000000 4000000 3000000 2000000 1000000 tions.
Sentence 2: if the change in time results in a linearly proportional change in ISN, the scatter plot should be a line with a constant slope.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Hence, A couldn't generate the leap-vector o7i and ~ (necessary to recover u from the broad- cast) from any of the user-keys in its possession: it follows that ..4 could not update any of its user-keys.
Sentence 2: all the secret data that .,4 gathered via the Join queries is completely useless to recover any message (and in particular A's challenge) encrypted after the Change-Period operation under consideration.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Knowing both the complexity of his password (15.0) and the probability that Plato fail to memorize a seven-digit password (30%), we can calculate how likely Plato is to fail to memorize his new password on the .rst attempt.
Sentence 2: (0.3)*(15.0) P = =0.193519 23.2535 Plato has around a 19% chance of failing to memorize his new password.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: The relatively small code size of researchhypervisors [31, 43, 47], combined with the recent breakthrough in formally verifying the L4 microkernel [27], raiseshopefor similarveri.cationofhypervisors.However, com­modity hypervisors often contain several thousand lines of code (e.g., 150K LoC in Xen 4.1) and are not yet within the realm of formalveri.cation.
Sentence 2: researchershaveproposed archi­tectures that completely eliminate thehypervisor [26].
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Therefore, the expected time to defeat integrity by a parallel attack is also a for large a large number of attackers n. 3.7.3 Availability As above, the .rst time at which n monoculture compo­nents can be compromised by multiple, parallel attackers is also the 1st order statistic of n independent samples of a random variable distributed according to f(t)because,as above, once one node is compromised, n can be quickly com­promised as well.
Sentence 2: the expected time to defeat availability in a monoculture by a parallel attack is also a for large a large number of attackers and nodes, n. 3.8 Multiple, Parallel Attackers againstNatural Diversity The analysis gets interesting because with parallel attack­ers, the time to defeat one of the CIA security goals depends on when the .rst, half, and last of the attacks are successful.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: A key insight of this analysis is that, the harvesting antenna cannot be reused by the NFC transceiver, due to the con­.icting requirements of the Q-factors.
Sentence 2: to support e.cient energy harvesting and reliable NFC communication at the same time, a dual antenna con.guration (one high Q-factor antenna and one low Q-factor antenna) must be adopted.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: While qa -pa 0 for all ratios of 0.1 = m = 1(seeFigures4, n m 5 and 7, 8), it also holds for all ratios but n =0.1, that qa - pa = 0.
Sentence 2: setting qa - pa = 0 slightly decreases Ei and gives us a lower bound on Ei, and therefore also a lower bound on the agility of our scheme in the analysis at the end of the section.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: In 2000, Hwang and Li [2] pointed out that Lamport s scheme suffers from the risk of a modified password table and the cost of protecting and maintaining the password table is large.
Sentence 2: they Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Considering discrete logs to the base g, we get the following equation: v v £=1 g=l that can be rewritten as: : A(0)-o- ~=1 £=1 As we argue below, the probability that the coefficient of w in (t) take the value 0 is negligible.
Sentence 2: w.h.p, we can recover the value of w. To complete the argument, we now show that: Pr [~ + ~=~[B(ze)'ye] -B(0)=0] =Uq" Consider the matrix whose generic row is (A~0,..., A(~0), and distinguish the following two cases.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: This may result in 119 perceptual distortions such as pre~echos.
Sentence 2: an ad- ditional scale parameter a and gain function g(n) are intro-duced to refine the watermark in the temporal domain: v(n) = ~(n) + ,~g(n),,,(n), (2) where ¢x is the global scale parameter, g(n) a data dependent gain function with values between 0 and 1, and y(n) the watermarked audio.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Supersingular curves have extra endomorphisms in their endomorphism ring, and these endomorphisms map points de.ned over the ground .eld to points de.ned over an extension .eld.
Sentence 2: given an endomorphism F, t(P, F(P )) .1, and we do not = have to worry about the points in the pairing being linearly independent.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: The timings in Table 2 can serve as benchmark for the .eld arithmetic and show a di.erence by a factor of roughly 2.0 between our OPF library and the .eld-operations of TinyECC.
Sentence 2: the .eld arith­metic contributes a factor of 2.0 (or 71.94%) to the overall performance gain of 2.78.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Query Qi with L(OPi) = C can write a data stream x only if L(x) = C.  Note that, for our example, a process executing at level [5, ., T ] can execute streams belonging to Company 5 in COI1 and all com­panies in COI3 and also streams derived from them.
Sentence 2: the pro­cess is trusted w.r.t.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Nonetheless,itis still possible for an adversary to launch parallel interception attack if all of the tasks assigned to a computing unit .nish before the end of the ini­tialization process of the secure execution environment.
Sentence 2: we need the last property, full coverage property, to achieve the full-occupation condition by ensuring that all available computing units .nish their tasks after the initialization process of the secure execution environment.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: For example, the semantic representation level of location described using GPS coordinates (longitude, latitude) is smaller than using the standard notations IETF RFC 4119 (Country, A3, A6-STS, HNO-HNS), which results in di.erent algorithms to measure the location precision.
Sentence 2: we can conclude that the representation format of context information directly in.uences the QoCI measurement algorithms.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: It needs to build mechanisms for querying, learning and most importantly maintaining this user intelligence, without which it may not be able to de­liver a personalized experience.
Sentence 2: a lack of standard mechanisms to capture relation­ships between di.erent user identity data, forces a SP to digress from its core competence of providing a service, and start making sense of this additional user intelligence.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Thus, the adversary can simply determine the complete execution .ow of the cipher process by continuously per­forming the above very simple spy strategy, i.e., just exe­cuting spy branches and measuring their overall execution time.
Sentence 2: the spy process will see the complete pre­diction/misprediction trace of the target branch, and is able to infer the secret key.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: D The two lemmas imply that, for any (F,P), the condi­tional expectation E[Xj |Fj(F,P)] is at most the prod­uct E/f(N) f(N)/|N| = E/|N|.Since |N|is neces­sarily k -j + 1, this implies E[Xj ] = E/(k -j +1).
Sentence 2: the large items cost in expectation at most k k E[Xj] = E/(k-h+1) = EHk.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: During the implementation of Relation 1 in PI N O CC H IO, we ob­served that comparison operations (=, =) are much more expensive than addition and multiplication.
Sentence 2: in the case of a unit­weight graph, we replaced the second constraint of Relation 1 by an equivalent equality constraint with an additional input auv, i.e., S[v] - S[u] - avu = 0, where avu .
Relationship: reasoning
Domain: Security and privacy
Sentence 1: NORMS AND SOCIAL ORDER Even if one attempts to manage enterprise security as if it were a police/bureaucratic state, in practice, the cost of gaining a complete understanding of all the components and operations of a large system is likely to be prohibitive.
Sentence 2: security tends to focus on those activities per­ceived to be critical, with an assumption that the other un­regulated activities, known or unknown, are not signi.cant.
Relationship: reasoning
Domain: Security and privacy
Sentence 1: Tokens do not contain an identi.er for a speci.c patient record; in fact, the LSP implements a protocol where a re­quest or query regarding a speci.c BSN and information category is forwarded (replicated) to all information sys­tems that contain a patient record of the BSN and type that matches the query, and have the LSP collect the re­sults before returning them back to the requestor.
Sentence 2: a single token can theoretically be used to request all records of a given patient (BSN) and information class in a single operation.
Relationship: reasoning
Domain: Software and its engineering
Sentence 1: This service is not able to capture CPU usage with granularity at the level of microseconds, since it relies on software level times maintained by POSIX compliant kernels.
Sentence 2: gVT recalculation in optimistic simulation platforms typically occurs accord­ing to periods on the order of tens of milliseconds, or even seconds, in order to keep the overhead of the GVT protocol low.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 2 Our goal is to construct a smaller version of Havlak s forest by eliminating some loops in the forest using the above lemma.
Sentence 2: rather than merge any two loops that satisfy the conditions of the above lemma we will only merge loops that share a common entry vertex, as this is easier and turns out to be suf.cient for our purpose.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One way to express the data dis­tribution among the threads is the declaration of smaller datasets using !$OMP THREADPRIVATE.
Sentence 2: two main reasons make us reject this approach: 1) e.cient inter­thread communications require threads to read (or write) their neighbors datasets and 2) the way compilers handle threadprivate datasets may be ine.cient.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Example 2.2 (Introduction of hashes) Let us take the .rst im­plementation of an abstract Counter seen above.
Sentence 2: if we have as an expression the following well-typed term: (fun x:Counter.t -> ()) (Counter.init) Then, if we write h for the hash of the module Counter, the com­pilation will lead to: (fun x:h.t -> ()) 0 this expression is not typable since h.t is an abstract type and its real implementation cannot be revealed outside the Counter module: we cannot prove that 0 of type int has type h.t as supertype.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This allows allocation of a budget for searching, with the budget being used to check the best candidates .rst.
Sentence 2: we assume that we have a best guess m for the provenance mark, and for each i, con.dence ci in the ith bit of m. Con.dence ci may be derived from the suggestions of datapoints, for example, using the average of con.dences of suggestions used to compute the ith bit of m. other measures of con.dence are possible, such as using the entropy of the suggestions for the ith bit.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Such a sequence detector needs to check the call-stack for the possible occurence of each pattern at ev­ery pro.le event, thereby causing the regression passes to be signi.cantly slower than the corresponding pro.le passes (Table 1).
Sentence 2: the techniques we proposed for the ac­tual runtimedetection ofpatternsin applications(seeSub­section 3.3) are quite lightweight as they require the instru­mentationof only thefunctionsand call-sitesthat occurina pattern.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: 3.4 Discussion Even though centralized approaches lack of the known prob­lems, like containing a single-point of failure and lacking scalability, they could be judged to be suitable for ALM.
Sentence 2: some further problems occur: There is no central point in a peer-to-peer live stream­ing scenario, except the source of the stream, which should not be burdened with the role of a central coor­dinator in key management for all streaming members.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Linux, probably the most-con.gurable piece of software ever, em­ploys more than 10,000 preprocessor variables for this purpose.
Sentence 2: this de-facto variability tends to be hidden in the code ; which on the long term leads to variability defects, such as dead code or inconsistencies with respect to the intended (modeled) variability of the software.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One possible requirement in this example context is to produce a wooden container with removable lid to hold pens and pencils, while another may be to transform the timber into a big pile of wood shavings for combustion.
Sentence 2: requirements in terms of the machine in this example could be a series of detailed steps that tell you how to hand-saw and plane the constituent wood pieces, and how to use nails and glue to best hold the box together.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: This iterative process might be viewed as an example of the Shewhart or Deming plan/do/check/act cycle, with the simulation model providing the plan for a specific experiment (the do ), then a checking of the experimental results followed by action both to improve the simulation model and, if justified, to improve the real-world situation being studied.
Sentence 2: in order to maximise the benefit from this approach we strongly believe that appropriate weights be given to both simulation and experimental aspects, and not to weigh one unduly at the expense of the other.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: .xed systems have reached su.cient maturity, in wireless and especially in mobile ad hoc environments, where no backbone network is assumed, many issues and questions are still open because of the recent establishment of this re­search area and its intrinsic complexity.
Sentence 2: for the same reasons, the design of systems for mobile scenarios is, at the same time, challenging and stimulating, since you have to cope with an extreme setting characterised by high degrees of changeability and unpredictability Developing applications for mobile computing is extremely di.cult and challenging, since designers have to deal with many aspects such as unpredictable disconnections and topol­ogy variability.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Most security applications are already de­signed to handle public keys (e.g., X.509 certi.cates), while other applications can leverage public keys to setup shared keys or passwords within the group.
Sentence 2: for ease of use, some applications may want to share additional infor­mation (e.g., email or IP addresses to simplify contacting other members or sharing data within the group).
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Introduction Model-based design represents the future of systems design, due to the ability of models to scale to complex systems, and the practice to synthesize large portions of a codebase.
Sentence 2: for someone just learning to leverage model-based approaches for their own do­main problems, there is a pivotal question that must be answered early in any system s design: Do I design a domain-speci.c mod­eling language, or take advantage of UML pro.les?
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: AcademicMindTrek '14, November 04 - 07 2014, Tampere, Finland Copyright 2014 ACM 978-1-4503-3006-0/14/11 $15.00 http://dx.doi.org/10.1145/2676467.2676495 drink together in the street or spring cleaning , during which inhabitants were asked to clean their street together.
Sentence 2: there were next to no attempts to give such activities a digital component, which is surprising, as a substantial part of people s lives these days is technology-mediated.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: One solution would be to recognize all elements at .rst and later analyze the AST to discover wrong nest­ing.
Sentence 2: this leads to another problem: If, for example, the enclosing link is reinterpreted as plain text after discovering an internal link inside its ti­tle, other parts of the a.ected Wikitext may need re­interpretation as well: [[target| * item 1 * item 2 [[other link]] ]]  Lists (in bold) are not recognized inside a link title.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Excess space saved for cooperative swap in the form of page repositories has very few constraints on placement: there is no re­quirement that swap pages are stored on the same physical ma­chine, nor do the page repositories need many other resources, like CPU.
Sentence 2: excess space saved for migration has more constraints: there must be enough resources to support a full VM co-located on a single physical machine, including memory and CPU.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: The difference in throughputs be­tween the concurrent collector and the single threaded generational mark-sweep (GenMS) can be as high as 40%.
Sentence 2: comparing the degradation rates of the three GC techniques, dCM S , dP arGC , and dgenM S , shows that both CMS and ParGC did t exhibit sig­ni.cant different on degradation rates.
Relationship: contrasting
Domain: Software and its engineering
Sentence 1: Strathcona Example Recommendation Tool Reid Holmes &#38; Robert J. Walker Department of Computer Science University of Calgary 2500 University Dr. NW Calgary AB Canada T2N 1N4 rtholmes, rwalker@cpsc.ucalgary.ca Gail C. Murphy Department of Computer Science University of British Columbia 201-2366 Main Mall Vancouver BC Canada V6T 1Z4  murphy@cs.ubc.ca ABSTRACT Using the application programming interfaces (API) of large software systems requires developers to understand details about the interfaces that are often not explicitly de.ned.
Sentence 2: documentation about the API is often incomplete or out of date.
Relationship: contrasting