probabilistic polynomial time
On the Computational Complexity of Software (Re)Modularization: Elaborations and Opportunities
... using probabilistic methods (in particular, methods whose probability of correctness can be efficiently boosted to be arbitrarily close to probability ...no probabilistic polynomial-time ...
7
Enhanced Security of Attribute-Based Signatures
... no probabilistic polynomial-time algorithm SimSign that given just the master secret and message, computes the satisfying attribute set and appends it to the ...
32
MODEL OF CYBERSECURITY MEANS FINANCING WITH THE PROCEDURE OF ADDITIONAL DATA OBTAINING BY THE PROTECTION SIDE
... A certificateless encryption scheme is Strong Type II secure if every II probabilistic, polynomial-time attacker 𝐴 𝐴 , 𝐴 , which is given the auxiliary information aux = msk, has negligi[r] ...
15
Semantic Security and Indistinguishability in the Quantum World
... A secret-key encryption scheme is said to be IND-qCPA secure if the success probability of any quantum probabilistic polynomial-time adversary winning the game defined by qCPA learning p[r] ...
37
Probabilistic & Statistical Methods in Cryptology An Introduction by Selected Topics pdf
... computing time on up to 120 machines was ...number) time! So in this case, the RSA and all related systems would be worthless against an adversary who has a quantum computer at his ...
159
Any time probabilistic sensor validation
... process. Probabilistic propagation is used to estimate the value of a sensor based on its related ...real time environment, an any time version of the algorithm has been ...
151
FLEXIBLE SHARING IN DHT BASED P2P NETWORKS USING METADATA OF RESOURCE
... a probabilistic real time interpreted system can be represented in the form: ( , ) v , where is a global location, and v is a clock valuation for all the clock ...of time, we have v ∈ R + , and ...
11
Polynomial Time Parsing of Combinatory Categorial Grammars
... Hence the shared forest representation we build is polynomial with respect to the length of the input, n, despite the fact that the number of derivations trees could be exponential... We[r] ...
8
A Polynomial Time Algorithm for Statistical Machine Translation
... The approach employs the stochastic bracketing transduction grammar SBTG model we recently introduced to replace earlier word alignment channel models, while retaining a bigram language [r] ...
7
A Polynomial Time Parsing Algorithm for TT MCTAG
... techniques. Polynomial parsing re- sults for tree rewriting systems based on paral- lel unordered rewriting have also been reported in (Rambow, 1994; Rambow et ...
9
M-POLYNOMIAL METHOD FOR TOPOLOGICAL INDICES OF 3-LAYERED PROBABILISTIC NEURAL NETWORKS
... 3-layered probabilistic neural network consisting on 3 layers of ...3-layered probabilistic neural network denoted by P N N (n, k, m) has n + k(m + 1) vertices and km(n + 1) edges, where n, k and m are ...
12
OCTAL: Optimal Completion of gene trees in polynomial time
... s adjacent to the newly created node. We then update A, the set of bipartitions for each tree, and the annotations of the edges of t and T as shared or unique. By Lemma 6, AddLeaf preserves all existing shared edges ...
18
On the Learnability of Shuffle Ideals
... Inferring regular languages from examples is a classic problem in learning theory. A brief sampling of areas where various automata show up as the underlying formalism include natural language processing (speech ...
19
Probabilistic Framework For A Time Series
... time series, for which realisation consist of a series of constant values, with a deferent constant value for each realisation. A law of large numbers does not apply on this case as the limiting value of an ...
6
Multi-party Poisoning through Generalized $p$-Tampering
... a polynomial time attack given oracle access to an online sampler for ...with polynomial time attackers for the special case of 2 parties, but their efficient attackers use a different oracle ...
22
Remarks on the Complexity of Signed k Domination on Graphs
... Proof. Following Lemmas 2 - 5 and the recursive definition of distance-hereditary graphs in Theorem 10, we can design a dynamic programming algorithm to compute the signed k-domination number of a distance-here- ditary ...
6
Counting and sampling paths in graphs
... fully polynomial randomized approximation scheme, or FPRAS (more formally defined in ...in polynomial time, and a proof of a polynomial run time bound on the mixing time which ...
74
ID Based Signcryption Scheme in Standard Model
... We first prove the Indistinguishability property, Indistinguishability of ID based signcryption under Adaptive Chosen Ciphertext and Identity Attack (IND-IBSC-CCIA2) of our scheme with the following theorem. Theorem 1. ...
18
A Revocable Online-Offline Certificateless Signature Scheme without Pairing
... the time period under consideration) and he acts as an adversary in the ...the time he has been ...any time period after the time when he has been ...a time instant t 0 ∗ > t # ...
25
Scalable Deniable Group Key Establishment
... As main technical tools, we will make use of a multiparty key encapsulation along with a suitable data encapsulation mechanism to send an identical message to multiple protocol participants in a confidential manner. For ...
17