sadat2307/MSciNLI huggingface dataset:
Domain: Security and privacy
Sentence 1: In a two-party interaction, say an interaction between Bob and Alice, it is not enough to consider Alice s trust in Bob; Bob s trust in Alice must be considered as well.
Sentence 2: [19], who state: In order to avoid misunderstanding it is always good to be as specific as possible when using the term trust management, by providing additional information about its meaning in a given context.
Relationship: neutral
Domain: Security and privacy
Sentence 1: p = J cand J c p; also, for any security level J, we have J = J tc, then for any security level J and policy p, we have J c p p = J c J and J t J = J.
Sentence 2: waivers are applied dynamically and can mention speci.c data objects, thus providing .ne-grain control over when information is declassi.ed.
Relationship: neutral
Domain: Security and privacy
Sentence 1: A practical scenario could be remote voting applications onPCs asthisconcernsprograms thatexecuteonce(after installation).
Sentence 2: instead of xi+1 = xi + a + y × ß where xi is locally available, we would get xi+1 = xi-1 + a+ y× ß if xi-1 in block BBa contains the label of the previously executed block, we might have multiple possible label valuesif severalblockscangivecontrol toBBa.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Address Obfuscation: an Ef.cient Approach to Combat a Board Range of Memory Error Exploits.
Sentence 2: the Supervisor bit is 0 when the processor executes user-level code, so the usrkey is used for decryption, and it is 1 when the processor executes kernel s code (supervisor mode), so the oskey is selected.
Relationship: neutral
Domain: Security and privacy
Sentence 1: This hybrid cascade con­struction thus strikes a balance between defending against passive attacks to disclose mixes input-to-output message correspondences, and ensuring that the end-to-end permuta­tion implemenated by the mix is an arbitrary permutation.
Sentence 2: of the cascade is consistent with a hypothesized set of fragile permutations used by the fragile mixes.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Since the attacker already established his AP as in­termediary, he can easily act as man-in-the-middle.
Sentence 2: these frames contain a high-precision timestamp 4http://rfakeap.tuxfamily.org/ 5http://airsnarf.shmoo.com/ 6http://www.digininja.org/jasager/ with microsecond resolution, which is used for the Timing Synchronization Function (TSF) to synchronize sending and receiving slots on the shared wireless medium in the IEEE 802.11 communication process.
Relationship: neutral
Domain: Security and privacy
Sentence 1: To that end, we formulate the problem of emulating emulation­resistant malware in terms of its environment observations, and propose an approach of comparison-based state modi.cation that modi.es the execution state of a malware sample to simulate a dif­ferent environment and so thwart the sample s anti-emulation tech­niques.
Sentence 2: in 9th USENIX Security Symposium, pages 129 144, Denver, CO, USA, Aug. 2000.
Relationship: neutral
Domain: Security and privacy
Sentence 1: MODEL OVERVIEW Following the model of Naor and Nissim, our authenticated dic­tionary (AD) is a component of a veri.cation system consisting of three independent networked objects: the dictionary, a separate database (or storage service), and a variable number of producer or consumer users.
Sentence 2: aPR-Quad can insert entire buckets of objects to amortize cryptographic operations.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The performance analysis discussed here considers the ef­.ciency of the implementations realized with two di.erent programming languages running on two di.erent machine architectures.
Sentence 2: as ahardwareimplementation,ECC has been often implemented using general purpose micro­controllers and FPGAs, however, a digital signal processor (DSP)can be more powerful than microcontrollers and less expensive than FPGAs [23].
Relationship: neutral
Domain: Security and privacy
Sentence 1: User perceptions related to identification through biometrics within electronic business.
Sentence 2: respondents finding authentication technologies acceptable in the retail domain Acceptable (%) Unacceptable (%) Unsure (%) Signature Analysis 48.7 17.4 33.9 Passwords 44.4 31.3 24.4 Smart Cards 33.9 28.7 37.4 RFID Tags 33.9 30.4 35.7 Fingerprint Scan 29.6 40.9 29.6 Hand Geometry 21.7 43.5 34.8 Digital Certificates 21.7 29.6 47.8 Other Tokens 19.1 27.8 52.2 Voice Recognition 18.3 49.6 32.2 Iris/Retina Scan 15.7 49.6 34.8 Face Recognition 14.8 50.4 34.8 Passwords are thought to be secure by more respondents than any of the object-based authenticators, which may partially explain why respondents would rather use passwords than tokens as a method of identity verification.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Attribute­based encryption schemes were also called public-index predicate encryption schemes in the literature [9].
Sentence 2: this is not a problem because, by semantic security, E and E are computationally indistinguishable so SimFE must work correctly, otherwise it breaks semantic security of the encryption scheme E. To prove indistinguishability of the simulated/ideal and real experiment outputs, we introduce a hybrid experiment.
Relationship: neutral
Domain: Security and privacy
Sentence 1: This can be eliminated by modifying the policy so that the authorization rule that generates r1 becomes senior to the one that yields r11.
Sentence 2: [7] Sandhu, R., Coyne, E., Feinstein, H., and Youman, C. Role­based access control model, IEEE Computer, 29(2), (February 1996).
Relationship: neutral
Domain: Security and privacy
Sentence 1: Unfortunately, thisis not the opti­mal solution for multi-core systems, because distributing the han­dling of interrupts from a single Rx-queue to multiple cores re­sultsin cache invalidation andperformance degradation[25].
Sentence 2: any changesinthe rule set require recompilation, regeneration of the automaton, resynthesis, replace­ment, and routing of the circuits, which is a time-consuming and dif.cultprocedure.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Brief Announcement: A Method for Exchanging Valuable Data: How to Realize Matching Oblivious Transfer  Shin'ichiro Matsuo NTT DATA Corporation 1-21-2, Shinkawa, Chuo-Ku Tokyo Japan matsuosn@nttdata.co.jp Currently, many types of financial transactions are being conducted over the Internet.
Sentence 2: there is no research that can realize both feature at once.
Relationship: neutral
Domain: Security and privacy
Sentence 1: [1] in­troduced the model of leakage-resilient chosen-plaintext (lr-CPA) security and showed that the lattice-based public-key encryption scheme of Regev [29] and the identity-based en­cryption of Gentry, Peikert, and Vaikuntanathan [13] were lrCPA secure.
Sentence 2: a block cipher based pseudo random number generator secure against side-channel key recovery.
Relationship: neutral
Domain: Security and privacy
Sentence 1: For each user of interest, we measure the accuracy across .ve datasets, where in each dataset, we vary the number of other users whose queries are mixed with that of the current user of interest.
Sentence 2: when the user of interest s query set is mixed with the queries of these other users , we form datasets with N as 100, 200, 300, 500 and 1000 users.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Additional to their context types identity, activity (we use task as equivalent), time, and location, we extend the context by legal constraints and   Figure 1: Context Map a second identity.
Sentence 2: example 2: TAuth = {(Alice, Bob, Bob s data, [2, 5], +)} states that an access for Alice to Bob s data with respect to the context time will be granted between the time points 2 and 5 including both time points.
Relationship: neutral
Domain: Security and privacy
Sentence 1: If the server accepts the client s attempt to log in, it returns to the client the set of credentials to which the client is entitled (according to the user-to-role map­pings of the system).
Sentence 2: suppose we infer an e.ective annotation of the set of roles R on a method m that is de.ned in class c. Suppose also that we infer an annotation R ' on all interfaces that c imple­ments that declare m. Then, we require that every role in R ' subsumes some role in R. a client that is authorized to a role in R ' has access to the method.
Relationship: neutral
Domain: Security and privacy
Sentence 1: If an AV scanner misses to detect a malware sample, the related label in the set L will be assigned a unique placeholder unknown family label.
Sentence 2: the three remaining validity indexes (Figure 4(b) through Figure 4(d)) clearly show that VAMO s reference cluster­ing agrees more closely with the underlying true clustering C, com­pared to the majority voting-based reference clustering.
Relationship: neutral
Domain: Security and privacy
Sentence 1: To do this, we can think of the e.ect of insertions/deletions as implicitly re­de.ning the notion of centroid to be more .exible than that of no subtree of size more than n/2 when the centroid is removed .
Sentence 2: the next section deals with decreasing the space complex­ity of the public information to O(n).
Relationship: neutral
Domain: Security and privacy
Sentence 1: (See[34,35,36]foran­otherlineofattakonthelassifationquestionforCSP(B) problems.)
Sentence 2: theorems7.3and7.5exhibitaverystrongonnetion betweenCSPandview­basedqueryanswering.Inpartiu­lar,sineintheredutioninTheorem7.3,thequeryandthe viewdefnitionsdependonlyongraphB,andonlytheview extensionsdependongraphA,thetheoremshowsthatnon­uniformCSPanbepolynomiallyreduedtoqueryrewrit­ing.Asaonsequene,ifwehadamethodtodeidewhether aninstaneofqueryrewritingadmitsaperfetrewriting thatisPTIME,wewouldthenbeabletopreiselyharater­izethoseinstanesofnon­uniformCSPthatareinPTIME.
Relationship: neutral
Domain: Security and privacy
Sentence 1: DESCRIPTION OF ZUC STREAM CIPHER The internal state of ZUC [9] consists of a 16-stage LFSR (s0,s1,...,s15) and two internal memory states R1 and R2, with each register stage containing 31 bits and each memory state containing 32 bits.
Sentence 2: in B. Preneel, editor, Advances in Cryptology EUROCRYPT 2000: International Conference on the Theory and Application of Cryptographic Techniques, volume 1807 of Lecture Notes in Computer Science, pages 392 407.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The authors presented a mechanism called O.-the-Record Messaging (OTR) that allows two-party private conversa­tions using typical IM protocols.
Sentence 2: we are concerned with malicious insiders so protocols that meet models as in­troduced in [17] are more suitable for our needs, since they allow the adversary to adaptively introduce malicious par­ties to the system.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The value V (s, f1,f2) of playing strategy f1 against strategy f2 under state s is de.ned as follows, V (s, f1,f2)=R(s, f1(s),f2(s))+ (4) dPr(f1(s),f2(s),s,s )V (s ,f1,f2) s.S where d is the discounting factor re.ecting the relative im­portance of future payo.s and Pr(f1(s),f2(s),s,s )isthe probability that the system state transits from s to s given that the players choose actions f1(s)and f2(s) respectively.
Sentence 2: it may be possible for the defender to employ a non-NE strategy that is just as e.ective, and potentially cheaper.
Relationship: neutral
Domain: Security and privacy
Sentence 1: If the maximum similarity score continues to converge towards the value 1 after each consecutive step in the set of performed interactions, then the visualization produced by the active user is becoming similar to a visualization used to identify or detect a sus­pected attack by an expert user.
Sentence 2: our technique can lead to attack discovery with less number of interactions and to the e.cient utilization of resources (e.g., memory and CPU utilization).
Relationship: neutral
Domain: Security and privacy
Sentence 1: Here, we see a highly­simpli.ed diagram of typical relationships in the FMM world.
Sentence 2: we have: Ci × (Ir + If ) = Rc × P × Ir (3) Rc × P × Ir Ci = (4) Ir + If we can see that as If is varied, the Cost per impression for breakeven changes.
Relationship: neutral
Domain: Security and privacy
Sentence 1: This section goes through the steps that need to be taken to implement the PolicyGlobe algorithm in the previous section.
Sentence 2: this means we have to check the following rules: 1. allow httpd_t http_port_t:tcp_socket {name_connect, tcp_recv, tcp_send}; 2. allow httpd_t self:tcp_socket {connect, read, listen, accept, write, create}; 3. allow httpd_t self:tcp_socket {getattr, setattr, recv_msg, send_msg}; 4. allow httpd_t netif_t:netif {tcp_recv, tcp_send};  The .rst rule says that the process needs to access the    Figure 1: An example network con.guration.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Modifying thepolicyfromExample5 toexecuteunder the invoker s privilege (by replacing the constant bob with the variable User)would still su.er from the same problem astheoriginalpolicyinExample4: all employeedatavisible to the query invoker would be leaked to Bob s leaked_info table.
Sentence 2: tD does not de.ne semantics for negations.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Categories and Subject Descriptors D. .
Sentence 2: w th a un que type ass gned to a collaborat ve team ( .e., a v rtual organ zat on), our TUCON­based pol cy scheme allows f ne-gra ned nformat on flow control beyond organ zat onal boundar es, and the autonomy of nd v dual collaborat ve teams.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Mark encoding convention: Given Si, c, vfalse and vtrue as above, we de.ne mark(Si) E{true, false, invalid} to be true if vc(Si) > (vtrue ×|Si|), false if vc(Si) <vfalse × |Si| and invalid if vc(Si) E (vfalse ×|Si|,vtrue ×|Si|).
Sentence 2: its main value lies in the huge commercial potential deriv­ing from mining buying patterns and association rules.
Relationship: neutral
Domain: Security and privacy
Sentence 1: 5.2.1 Benchmarks We ran all the integer benchmarks from the SPEC CPU2006 suite (CINT2006) [49], which includes several CPU-intensive ap­plications.
Sentence 2: to the best of our knowledge, it is not possible to inject code in the instruction cache without passing from the path we have modi.ed to decrypt each instruction.
Relationship: neutral
Domain: Security and privacy
Sentence 1: We have performed small-scale studies in which acquaintances, good friends, and family members attempt to impersonate a user, and observed that security is severely a.ected when a family member is the attacker, but only slightly a.ected in other cases.
Sentence 2: in our emulation, each of the 6800 hypothetical users picks 8 items he likes and 8 items he dislikes as his setup.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The computers used were Dell workstations with 3.20 GHz Pen­tium 4 processors and 1 GB of memory.
Sentence 2: the output will consist of best-ranked physicians where the ranks are determined using the weighted sum of the physicians scores for the individual con­ditions, weighted by the patient-provided importance values vi s, i.e., the combined scores are computed as  P. sjK = i=1 visjki ,where sjki is the physician j s score for condition ki .
Relationship: neutral
Domain: Security and privacy
Sentence 1: Finally we emphasize that virtualization and/or separa­tion kernels are not the only tools available for secure parti­tioning.
Sentence 2: we follow from the assumptions and the de.nition of R that q1.cg = q2.cg, q1.t = q2.t, Og(q1) = Og(q2) and q1.idx = q2.idx.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The grade of a candidate role indicates the number of permissions assigned to that role, that is: grade(r)= |auth perms(r)|.
Sentence 2: 4.1 Completeness and minimality Given the set UP, the objective of role engineering is to determine the sets ROLES, PA, UA and RH which cover all possible combinations of permissions possessed by users atthelowest administrationcost.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Therefore, we had to replace the .rmware of the phone with a custom build of CyanogenMod9 [20] based on Android 4.0.3 where we in­ cluded the smart card API patches (version 2.3.2).
Sentence 2: we present the implementation and evaluation of our solution in Section 5 and analyze its security in Section 6.
Relationship: neutral
Domain: Security and privacy
Sentence 1: G a gen­erator of G, and s the bit size of p. The n-DHE problem is de.ned 2 kn kn+2 2n as follows: given set V = {g, g k , g k,.
Sentence 2: in DVS, the server combines the signatures of all the machines into a single one, always maintaining the communication cost of 10 bytes.
Relationship: neutral
Domain: Security and privacy
Sentence 1: SELinux grants accesses by checking domains of subjects (e.g., un­trusted_app), types of objects (e.g., wallpaper_files), and SELinux permissions (e.g., open, read)2 .
Sentence 2: as native code is used by only a small fraction of benign Android applications but most malicious root exploits [30], native code would draw attention of anal­ysis tools, breaking a detection heuristic s basic purpose of evading analysis.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Observe the somewhat unusual feature that the keys (Yi,Ki, Zi) of server Si depend upon the key 1~-1 of server Si-1.
Sentence 2: let Y0 = g. As a preliminary to the mixing operation, each server Si selects three private keys, al,/3i,% Ev Zq, where Ev denotes uniform, random selection.
Relationship: neutral
Domain: Security and privacy
Sentence 1: As discussed above, the inference channels previously de­scribed can be blocked by imposing con.icting tuples to be associated with di.erent index values.
Sentence 2: user B infers that the .rst, fourth, and .fth tuples of relation Shops include the association (2010,600), (2011,700),and (2011,700) for the pair of at­tributes (Year,Sales),respectively.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Ciphersinthebounded-storagemodelmakeuseofavery largeamountofauxiliaryinformation,denotedRandalled publirandomnessorsimplytherandomizer.Therandom­izerRouldforinstanebearandombitsequenebroadast byasatelliteortransmittedbetweenthelegitimateparties, orthesignalofadeep-spaeradiosoure.IfRisat-bitran­domstring,thentsisrequiredtoguaranteethatEvean­notstoreRompletely.3Therestritiontsimmediately showstheinherent(butonly)limitationofthebounded­storagemodel:Inordertoberealisti,sandhenealsothe sizeofRmustbeverylarge.Nevertheless,shemesbased onthismodelforwhihtisnotmuhlargerthansmaybe onthevergeofbeingpratial,evenforverypowerfulad­versaries.Themainhallenge,whihwesolveinthispaper, istodeviseaprovablyseureshemewithslosetot.
Sentence 2: therefore P 1 --- =P- 1 --- (26) whihimpliesthatforallvaluesof(s1,...,sj-1)wehave E[SjIS1=s1,...,Sj-1=sj-1]=0.
Relationship: neutral
Domain: Security and privacy
Sentence 1: A similar approach has been pro­posed in 2013 [40] by considering, as features, the presence of speci.c sequences of name objects obtained by parsing the logical tree of the .le.
Sentence 2: we observe that it may A .le is classi.ed malicious if at least one tool classi.es the main PDF .le or one of its embedded content, as malicious.
Relationship: neutral
Domain: Security and privacy
Sentence 1: With Robust Discretization, each click-point in a password is associated with an image, a grid selected for the click-point, and a grid-square in the grid where the click-point lies in.
Sentence 2: if the prediction of click-points is not very accurate, then the IDD scheme may not be as attractive as other discretization schemes, since a wrong prediction may result in a click-point far away from the center of a Voronoi polygon tile, leading to a significant reduction of the tolerance range of click­variations, and thus may cause unacceptable false accepts and false rejects.
Relationship: neutral
Domain: Security and privacy
Sentence 1: 1254 many Montgomery operations performed in RSA exponentiation provide useful informa­tion for BB-attack.
Sentence 2: clearly, for in­put y = u(R05)-1 (mod n) (inverse in the ring Zn) we have -1 -1 y¯2;q = M M ( ¯y1, y¯1 ; q) = u(R05)u(R05)R = u 2 (mod q).
Relationship: neutral
Domain: Security and privacy
Sentence 1: The KAoS Policy Services framework was the first to offer an ontology­based approach (based on the W3C standard, OWL 2) to policy representation and reasoning, and its core ontology has been adopted by the NSA-sponsored Digital Policy Management (DPM) Architecture Group as the basis for future standards efforts in DPM.
Sentence 2: they may be in 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: neutral
Domain: Security and privacy
Sentence 1: A user can now prove that he is a valid group member by prov­ing that he has a CL signature on some value f. This can be done by a zero-knowledge proof of knowledge of f, A, e,and eRf Sv v such that A= Z (mod N).
Sentence 2: the veri.er cannot tell a differ­ent veri.er that uses a different named base to revoke that private key, because when a different name is used and the revoked key cannot be identi.ed.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Conventional blacklisting is not going to cut it in this situation, and the established fact that malicious IP addresses tend to be highly clustered in certain portions of IP address space, should indeed raise suspicions.
Sentence 2: 5.4 Tuning Clustering Hyperparameters Now that our clustering methodology is de.ned, our remain­ing task is choosing the clustering procedure hyperpameters, namely the threshold t and the window size parameter |.|.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Cuppens [8] studied the aggregation problem and proposed a model based on modal logic to control ag­gregation problems and the work of Foley [13, 14] addresses the aggregation problem with information .ow policies, how­ever these papers do not address the speci.c case of QBA problems.
Sentence 2: alice could have queried these parcels in a di.erent order: P1, P2, P3, P4 then P6, thus acquiring the knowledge of the owners of 5 out of 6 parcels.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Preserving complete network trace records for extended periods of time is becoming almost impossible because of 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.
Sentence 2: simi­lar byte strings are moved close to each other such that they fall within the compression window of gzip.
Relationship: neutral
Domain: Security and privacy
Sentence 1: We expect that our new fuzzy IBE schemes will serve as e.cient building blocks for biometric authentication sys­tems or attribute-based encryption systems.
Sentence 2: its pri­vate key extraction has been simpli.ed by using the outputs of the chosen random polynomial as random exponents for g1, in contrast to the scheme in [8] which introduces extra random exponents and hence incurs extra exponentiations.
Relationship: neutral
Domain: Security and privacy
Sentence 1: CONCLUSION This paper presents a novel architecture for taint-based data protection using a combination of machine virtualization and emulation, safely achieving high-performance for computa­tion by dynamically switching to emulated execution only when tainted data is being handled by the processor.
Sentence 2: if the application was processing tainted data at the time, one or more registers containing tainted data would be pushed onto the kernel stack as shown in Figure 7(a).
Relationship: neutral