sadat2307/MSciNLI huggingface dataset:
Domain: Security and privacy
Sentence 1: Moreover, the two inequalities (lines 4 and 5) hold only when k = s or k = d, indicating that it is bene.cial to use the updated edge esd and its correspond­ing hosts hs and hd in leveraging some path s access level.
Sentence 2: more speci.cally, an adversary .rst gains admin level of access on host V (as described earlier), followed by the utilization of the shell account trust relationship from V to Cf ; edge labeled (V Cf,Trust,admin,shell,-).
Relationship: neutral
Domain: Security and privacy
Sentence 1: In addition, homomorphic en­cryption technology can address the privacy protection in situations where a server should blindly perform some pro­cessing on the data (i.e., labels 3 and 5).
Sentence 2: similarly, in the Personal Information Protection and Electronic Docu­ments Act [11] personal information is de.ned as informa­tion about an identi.able individual.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The authors also propose a Merkle-tree construction for constructing public POR, which can be veri.ed by any external party without the need of a secret key.
Sentence 2: we note an important difference: while in [35] the chal­lenge (I , {(i, .i)}i.I ) is randomly sampled, challenges in Fortress are generated pseudo-randomly using the pseudo-random bit gen­erator g with a seed extracted with GetRandomness.
Relationship: neutral
Domain: Security and privacy
Sentence 1: We would ideally like a solution which works under the sole assumption that the clients have an au­thenticated channel to each of the workers, as this is strictly more general and better models practice, where clients might authenticate themselves towards the computation providers using a simple password mechanism on top of a server au­thenticated secure transport layer.
Sentence 2: figure 4: Algorithm to identify potentially inconsis­tent client input.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Some of 1http://sourceforge.net/ 2https://github.com/ 3https://www.mozilla.org/ 4http://www.fazend.com/ 5https://www.travis-ci.org/ 6https://www.tddium.com/ 7https://buildhive.cloudbees.com/ these services o.er free usage plans to FLOSS projects and even integrate into software forge services like github.
Sentence 2: maintainers of FLOSS projects have to maintain CI systems on their own servers if they want to use CI.
Relationship: neutral
Domain: Security and privacy
Sentence 1: For example, the query :addr in 10.0.0.0/8 &#38;&#38; conn.proto == "udp" would match all events containing an IP address from the subnet 10.0.0.0/8 with transport protocol UDP.
Sentence 2: the system, visibility across space and time (VAST), uni.es in a single framework retrospec­tive data analysis and proactive measures to automatically apply previously developed queries to events that may occur in the future [1].
Relationship: neutral
Domain: Security and privacy
Sentence 1: arcac(A, R, C),arcap(A, R, C), not arcai(A, R, C).
Sentence 2: principals may be assigned to categories according to whether they have a shared attribute, a shared measure of trust, a common security clearance, as a consequence of an assignment to the same department, division, organization, as a consequence of actions or events, ... or any combination of these forms of cate­gory types.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Therefore, if a label-attachable TC in an application group joins a domain, then all of the label­attachable TCs in the same group must also be forced to join the same domain.
Sentence 2: for example, when an instance of Microsoft PowerPoint participates in Domain yellow, all instances of other applications in the Microsoft Office group such as Microsoft Word and Microsoft Excel will be forced to participate in Domain yellow.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Three independent groups were formed to compare PassShapes, EyePassShapes and EyePassShapes with the repeated input strategy.
Sentence 2: it is easier and cheaper to deploy than standard eye tracking systems since it does not require to know the exact position of the user s gaze and thus no calibration, which also makes it ex­tremely robust and appropriate for outdoor situations.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The BFlow reference monitor uses the tracking information to restrict how data is revealed: if a script has seen con.dential data, it can only communicate with the site whence the con.den­tial data came unless that site explicitly permits communi­cation with other servers.
Sentence 2: users might also be confused that frames have different security labels and type sensitive data into frames with L = {} which would leak the data.
Relationship: neutral
Domain: Security and privacy
Sentence 1: [9] Lindqvist, U., and P. Porras, "Detecting Computer and Network Misuse Through the Production-Based Expert System Toolset (P-BEST)," Proceedings of the 1999 IEEE Symposium on Security and Privacy, Oakland CA, May 9- 12, 1999.
Sentence 2: applications can be either a service, which is a special continual process on NT/W2K similar to a daemon under Unix; or an application can run as an ordinary process.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Once a predictive model for a Strong PUF has been derived, the two main security features of a Strong PUF no longer hold: The PUF is no longer unpredictable for parties that are not in physical possession of the PUF; and the physical unclonability of the PUF is overcome by the fact that the digital simulation algorithm can be cloned and distributed arbitrarily.
Sentence 2: since PUFs cannot be scaled inde.nitely due to cost and stability constraints, also mild exponential growth rates may be acceptable in certain situations, as long as the algorithm still can break practically relevant PUF sizes.
Relationship: neutral
Domain: Security and privacy
Sentence 1: These readings are, as a norm, primitive types such as integers, longs and .oats, or small collections of primitive types.
Sentence 2: by employing an end-to-end security approach the latency associated with each module is independent of the length of the paths that events travel so the added latency is pre­sented without taking the path length into account in Table 1.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Bloom Filters have a distinct advantage in this re­gard (see related work), and the performance gap between the two approaches is small: 97.8% AUC versus 99.9% be­tween BFs and LR/RF.
Sentence 2: it does this by creating independent load balancer cookies that are optionally tied to the duration of the application session cookie.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In our architecture, we need to verify policy com­pliance at two layer transitions: (1) between the application policy and the operating system policy in the web application (Browser) VM and (2) between the web application VM policy and the overall system policy stored in the VMM.
Sentence 2: we fo­cus primarily on the client (browser) side of web applications in this paper.
Relationship: neutral
Domain: Security and privacy
Sentence 1: When nsert ng a new block B nto the document P n pos t on j, a new random value rj¶ s chosen and then compute Cj¶ )k(rj¶__%__Uj), Cj- ¶ )k(rj- ||pj- ||rj¶ and C + ¶ &#38; for from j to n. Furthermore, new r0 and r are chosen at random, and the check sum r* s recomputed.
Sentence 2: [ ] M. Bellare, O. Goldre ch and S. GoldwasseU ³,QFUHPHQWDO cryptography: The case of hash ng and s gn ng," Advances n Cryptology -Crypto Proceed ngs, Lecture Notes n Computer Sc ence Vol.
Relationship: neutral
Domain: Security and privacy
Sentence 1: This holds in the base case (information-theoretically) since U * doesn t know K. Again by induction, we may assume that U * can only generate EK ( reject '' ,j),EK ( repeat '' ,j)for j less than or equal to the total number of rejected/repeated queries thus far.
Sentence 2: without loss of generality we may assume r is the same in every execution.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The knapsack schemes using the low-weight plaintext that is encoded before encryption is proposed by Chor-Rivest (CR) [9] and Okamoto-Tanaka-Uchiyama (OTU) [10].
Sentence 2: this type of knapsack cryptosystems has been referred to as the modular knapsack cryptosystem.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Since it may be valuable to have the possibility to re­place or remove (speci.ed) parts of a message after signature creation such that the original signature stays valid (and no interaction with the original signer is required), redactable [23, 13] as well as sanitizable signature schemes [3] have been introduced.
Sentence 2: )having a symmetric pairing e : G × G .
Relationship: neutral
Domain: Security and privacy
Sentence 1: This technique has been employed by sandboxing systems to limit the sandboxed program s access to system resources.
Sentence 2: 6.2 Enabler 6.2.1 Browser Extension All browser instances are equipped with an extension that is responsible for two tasks: (1) report all user-requested URLs to the daemon and (2) open a new tab for URLs requested by the daemon.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The distinc­tion of the C-REM method is that, in an m-banking context, the severities associated with di.erent marginal fraud risk factors are of di.erent types with di.erent physical units (e.g., the unit of money, the unit of time, and the mea­surement of location, etc.).
Sentence 2: section 7 compares the C-REM with relevant works in literature.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Given that we are considering only threat models that re­quire adversary persistence, system compromise is only pos­sible i. there has been a succession of vulnerable platforms played by the defender.
Sentence 2: during each of 500 Monte Carlo (MC) trials lasting M = 100 moves each, we evaluate .ve di.erent game strategies for the defender selection process: Uniform : Uniform random selection at each interval from the fully available set without immediate repeat  Random 3 : Uniform random selection of K = 3 plat­forms prior to the trial, then periodic rotation between them  Diversity : Optimizing diversity through Eq.
Relationship: neutral
Domain: Security and privacy
Sentence 1: , g n-1} denote the set of group elements generated by g. The group G is called cyclic if there exists an element g .
Sentence 2: [2n]{n+1} =j assuming that it has access to the set of outer product values c. the server does not need to explicitly generate c. Rather, L it only needs the vector of n different c[i][j]values, i+(n-j+1)=z for 2 = z = 2n.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The reason to treat generic objects and computer-detectable objects differently is to prevent attacks from recognizing an object or detecting the distortion applied to decoy objects to solve a challenge.
Sentence 2: the color edge intensity in each different direction is estimated by calculating the .2distance between the models of the two resulting disc halves: #bi#s(hln-h2n)2 X2(h1,h2) = 12 .#=1 , (1) hln-h2n where h and h are the color histograms of the two disc halves.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Vulnerability in the Information Age: What Browsers Reveal Brunna Albuquerque Carlos Filipe C. Regis Josilene Aires Moreira albuquerque.brunna@gmail.com carlosfilipe17@gmail.com josilene@ci.ufpb.br Universidade Federal da Paraíba Centro de Informática CEP 58059-900 - João Pessoa - PB ABSTRACT The exponential growth in the use of web services and applications has increased the amount of personal information registered on websites and databases worldwide.
Sentence 2: [5] Chaabane, A, Kaafar, M. A., and Boreli, R. Big Friend is Watching You: Analyzing Online Social Networks Tracking Capabilities.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Our model is closely related to the Refereed Games (RG) model of Feige and Kilian [10] where they focus on two unbounded com­peting servers and polynomial time referee/client.
Sentence 2: our construction is not based on probabilistically checkable proofs or Fully Homomorphic Encryption, which are not practical yet, nor does it rely on trusted hardware.
Relationship: neutral
Domain: Security and privacy
Sentence 1: As a result, the speci.cation and the implementation are tightly linked, signi.cantly reducing the possibility of modeling errors.
Sentence 2: aKI s design implies that if validators are not continuously online or have rooti h13 h14 h9 h10 h11 h12 h1 h2 h3 h4 h5 h6 h7 h8 rooti-1 A.com D.com F.com K.com P.com S.com Z.com  Figure 2: Integrity Tree in i-th ILS_UP period.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Both graphs represent the same result in two di.er­ent prospectives.
Sentence 2: these graphs conform to the complexity of O(kl) explained earlier for .xed values of n and m. Figure 3: Run time for di.erent l 3De.nition of splitting context variable can be found at [6] The redundancy check algorithm only checks and provides the score of the containment.
Relationship: neutral
Domain: Security and privacy
Sentence 1: We have seen that translation of re­source identi.ers is trivial, and that translation of device identi.ers is either straightforward or unnecessary.
Sentence 2: it is not clear that all terminals will necessarily be capable of accessing all tools (which might only be avail­able for one particular computing platform, for example) or that all devices, particularly smaller ones, would necessar­ily have the resources to store and execute all of the tools required to access all of the multimedia owned by one user.
Relationship: neutral
Domain: Security and privacy
Sentence 1: [12] R. Canetti, Universally composable security: A new paradigm for cryptographic protocols, in Proc.
Sentence 2: we show that given an optimal solution for consensus, our construc­tion yields a solution for GKE that uses only O(n2)messages and Copyright 2004 ACM 1-58113-802-4/04/0007 ...$5.00.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Quanti.ed risk and bene.t can be used to strengthen the security of information sharing, because: * A full version of this paper is available at http://old.homepage.fudan.edu.cn/ wlhan/paper/qsbac.pdf Each security policy implicitly considers risk and ben­e.t.
Sentence 2: horizontal integration: Broader access models for realizing information dominance.
Relationship: neutral
Domain: Security and privacy
Sentence 1: When an RSU has to respond to an OBU about a query on a certificate, it proceeds in the following way.
Sentence 2: thus, the number of updates that are necessary to insert a leaf node without involving a new level of depth in the tree is (2) .. ..... if it is necessary to increase the depth of the tree due to the insertion of a new node, our proposal simply creates a new root node above so that the existent tree becomes a subtree, and a new internal node is inserted so that the new leaf node is at the same depth of the other leaf nodes.
Relationship: neutral
Domain: Security and privacy
Sentence 1: This also resembles the tradi­tional software engineering practice where the development of a design model (business logic) and a security model are treated as di.erent tasks.
Sentence 2: mODEL TO CODE TRANSFORMATION In this section, we .rst present an encoding of break­glass policies in XACML and, second, we present a code­generation for both the security model and the design model given as SecureUML model.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Since past few years, oil-dependent internal combustion engine vehicles increasingly arise under scrutiny, Plug-in electric vehicles (PEVs) that significantly reduce dependence on fossil fuel are considered as foremost alternative to them.
Sentence 2: 4.1 Primitives 4.1.1 Elliptic curve cryptography (ECC) Elliptic curve cryptography (ECC) [8] is a promising public-key cryptosystem.
Relationship: neutral
Domain: Security and privacy
Sentence 1: However, an additional group element easily .ts intothe512bytes .x-sizedTorpackets(orcell) intheel­liptic curve cryptography(ECC) setting.
Sentence 2: let E1 be the event that the at­tackeris notapartnerto(x2,y) and E2 the even that the attackeris not apartnerto(x1,b).
Relationship: neutral
Domain: Security and privacy
Sentence 1: For user de.ned Application LOC Servlets SCL Employee Dir 5,658 7(10) 23 Bookstore 16,959 3(28) 71 Events 7,242 7(13) 31 Classi.eds 10,949 6(14) 34 Portal 16453 3(28) 67 Checkers 5421 18(61) 5 O.cetalk 4543 7(64) 40   Table 1: Applications from the test suite methods, corresponding to each String parameter, a candi­date parameter is added to the method signature and an identity statement is inserted in the method body for pa­rameter passing.
Sentence 2: another possibility is to use static analysis techniques[12] to construct the programmer-intended queries for each pro­gram point that issues a query.
Relationship: neutral
Domain: Security and privacy
Sentence 1: In order for virtualization-based approaches to work in a data forensic framework, they need to .rst overcome the disconnect in semantic views at di.erent layers in an op­erating system [3, 12].
Sentence 2: file-system integrity and veri.cation has a long history, withsome earlynotable examplesbeingthework ofSpa.ord et al.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Creation Rights: Used by useraddto create a new user s initial home, so we need to ensure that this is done atomically without dependence on user (analysis external to SELinux policy).
Sentence 2: all the constraint con.icts can be identi.ed by the minimal cover assign­ments which we aim to use to reduce the complexity of reason­ing about constraint con.icts.
Relationship: neutral
Domain: Security and privacy
Sentence 1: They alsode.ned the concept of one-way authenticated key exchange (1W-AKE), .xed the fourth protocol [15] to obtain a provably secure construction called the ntor protocol, and described its utility towards onion routing.
Sentence 2: it currently employs nearly three thousand dedicated routers (or OR nodes) and serves hundreds of thousands of users all over the world.
Relationship: neutral
Domain: Security and privacy
Sentence 1: [4] V. Popov, I. Kurepkin, S. Leontiev.
Sentence 2: necessary to check the availability of plain texts reducing the As a check result of input vector value of the 17th round number of encryption rounds under the key different from the on [1; 233] and [260;264-1] segments 24 vectors were found to zero.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Fq, computes all {hi(v)}i=j,...,m and {fi(v)}i=j,...,m, and gives {v, {hi(v)}i=j,...,m, {fi(v)}i=j,...,m} to this group member via the secure communication channel between them.
Sentence 2: the broad­cast size in session j is ((m + j +1)t + m +1) log q,which is a little smaller than that in Scheme 2.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Table 1: A brief comparison among (T)OAKE, HMQV and KEA KA = KB involves only a single hashing, where the out­put length of h, i.e., l, is set approximately to be |q|.For applications where g ab-traceability takes priority over HP­ Ab+yXb+ey Ba+xY a+ex deniability, we set KB = = = KA , which is referred to as traceable OAKE (T-OAKE, in short).
Sentence 2: in addition, as to be discussed in Section 6.5, it well supports deployment in the public computation model  For the item of Assumptions in Table 1, by SKEA (resp., SJKEA, GDL) we refer to strong KEA (resp., strong JKEA and gap DL), where GDL (resp., SJKEA) is weaker than GDH (resp., SKEA) in the RO model as discussed in Sec­tion 2 and 4.
Relationship: neutral
Domain: Security and privacy
Sentence 1: It is up to the calling applications to pass a communication 5This di.ers slightly from the earlier version described in [5], where NymSystem was parametrized with .le locations of secret keys Figure 5: User, Org and DeAnOrg Token-Based and Synchronous interfaces object that implements these interfaces.
Sentence 2: a user U can obtain a credential C from an (issuing) organization OI ; and then show the credential C to another (verifying) organiza­tion OV .
Relationship: neutral
Domain: Security and privacy
Sentence 1: Indeed the mean E[IL(P 3)]= 1 - 1 log(|A| - 1) is larger than |A| E[IL(P 4)] = log |A| - 1(forall |A| = 2), indicating that P4 may be leaking more information than P3.
Sentence 2: |A| |A| « 88 , ··· , 7|A| 7|A| 2.1 Reducing Leakage Several past approaches have suggested outputting a FAIL 8 .
Relationship: neutral
Domain: Security and privacy
Sentence 1: All these characteristics of Future Internet systems have a major impact on software design and on the enforcement of role-based access control policies: -the strongly dynamic and open nature of Future Inter­net systems forces the global architecture that includes and coordinates all software modules to be distributed and adap­tive -enforcement mechanisms for RBAC policies need to be tailored to distributed and adaptive software architectures.
Sentence 2: working on this abstract model repre­senting the running system allows applying various adapta­tion strategies in an o.-line mode to generate a target model.
Relationship: neutral
Domain: Security and privacy
Sentence 1: The graph gen­erator [4] we use is specially designed for generating graph datasets for evaluation of frequent subgraph mining algorithms.
Sentence 2: the mechanism then draws a sample from the distribution on X which assigns each x a probability mass proportional to exp(eu(D, x)/2.u), where .u = max.x,D,DI |u(D, x) - u(D', x)| is the sensitivity of the score function.
Relationship: neutral
Domain: Security and privacy
Sentence 1: A level of trust or level of assurance (LoA) re.ects the degree of con.dence that a relying party can assign to the assertions made by another identity provider with respect to a user s identity information.
Sentence 2: for each identity attribute, a so called claim, an attribute context is stored to hold informa­tion such as the method of veri.cation that has been used to verify the claim.
Relationship: neutral
Domain: Security and privacy
Sentence 1: To prevent a user from double-spending his digital coins, the ob­server is trusted to only produce this signature at most once (i.e., for each coin, the observer stores a random number that is needed to produce the signature for that coin, and then erases it after using it once).
Sentence 2: 2 by combining our proposed new features for vir­tual monotonic counter features with existing features in the TPM for supporting encrypted keys and data blobs.
Relationship: neutral
Domain: Security and privacy
Sentence 1: U proves in zero knowledge that s is a valid signature on m, t and some unknown d where d = tcurr using the following proof of knowledge:  (a) Both U and S locally compute vr = e(a6,g s), vd = e(a8,g s), vsig = e(a9,g), and s)ms)t V = e(a1,g s) · e(a5,g · e(a7,g .
Sentence 2: the latter can normally be accomplished by sending a commitment to the expo­nent and showing that the committed value lies within a speci.c interval [a, b].
Relationship: neutral
Domain: Security and privacy
Sentence 1: 3.1 Design and Structure The broadcast report in the proposed SAS is a combination of two reports: a group invalidation report and an object invalidation report as shown in Figure 5.
Sentence 2: the main advantage of the TS strategy is the ability of the mobile node to disconnect for one or more broadcasting interval and still be able to invalidate its cache at the next reconnection.
Relationship: neutral
Domain: Security and privacy
Sentence 1: Complete syntax and semantics are given along with a study on their algebraic properties.
Sentence 2: the execution path P1 is depicted in Figure 7(b): V (G)= V (P1) P1 =({cs,t1,t2,t3,ce}, {cst1,t1t2,t2t3,t3ce}) |P1| =4 (a) Sequence Pattern (b) Sequence Flow Runtime Path Figure 7: Sequence Pattern Parallel Split Pattern: The Parallel Split or AND-Split pattern allows a single thread of execution to be split into two or more branches, which can execute tasks concurrently.
Relationship: neutral