Search references for COMPUTATIONAL INDISTINGUISHABILITY. Phrases containing COMPUTATIONAL INDISTINGUISHABILITY
See searches and references containing COMPUTATIONAL INDISTINGUISHABILITY!COMPUTATIONAL INDISTINGUISHABILITY
Property whereby no efficient algorithm can distinguish two distributions
quantum commitments, and computational quantum money (see also Quantum cryptography). Lecture 4 - Computational Indistinguishability, Pseudorandom Generators
Computational indistinguishability
Computational_indistinguishability
Topics referred to by the same term
up indistinguishability in Wiktionary, the free dictionary. Indistinguishability may refer to: Identical (indistinguishable) particles Computational indistinguishability
Indistinguishability
Property of some cryptosystems
Ciphertext indistinguishability is a property of many encryption schemes. Intuitively, if a cryptosystem possesses the property of indistinguishability, an adversary
Ciphertext indistinguishability
Ciphertext_indistinguishability
Type of cryptographic software obfuscation
same size which implement the same function are computationally indistinguishable. Indistinguishability obfuscation has several interesting theoretical
Indistinguishability obfuscation
Indistinguishability_obfuscation
Cryptographic proof technique
a proof technique used to show that two distributions are computationally indistinguishable. Hybrid arguments had their origin in the papers by Andrew
Hybrid argument (cryptography)
Hybrid_argument_(cryptography)
Computational concept
statistically close to uniform, in a PRG it is only required to be computationally indistinguishable from uniform, a somewhat weaker concept. The min-entropy of
Randomness_extractor
Type of functions designed for being unsolvable by root-finding algorithms
k {\displaystyle p(k)>k} for any k), and if its output is computationally indistinguishable from true randomness, i.e. for any probabilistic polynomial
Cryptographically secure pseudorandom number generator
Cryptographically_secure_pseudorandom_number_generator
Proving validity without revealing other data
witness-indistinguishable proof protocols. The property of witness-indistinguishability is related to that of zero-knowledge, yet witness-indistinguishable protocols
Zero-knowledge_proof
Hypothesis in computational complexity theory
In computational complexity theory, a computational hardness assumption is the hypothesis that a particular problem cannot be solved efficiently (where
Computational hardness assumption
Computational_hardness_assumption
Key derivation function based on an HMAC
and replaced with computational indistinguishability. Extractors that provide this form of relaxed guarantee are called 'computational extractors'. In this
HKDF
American cryptographer (born 1974)
foundational contributions to cryptography, including the co-invention of indistinguishability obfuscation, attribute-based encryption, and functional encryption
Amit_Sahai
Subfield of information theory and computer science
constant – Halting probability of a random computer program Computational indistinguishability – Property whereby no efficient algorithm can distinguish
Algorithmic information theory
Algorithmic_information_theory
Provable security Statistically close Pseudorandom ensemble Computational indistinguishability Goldreich, Oded (2001). Foundations of Cryptography: Volume
Distribution_ensemble
Automatic generation or recognition of paraphrased text
Paraphrase or paraphrasing in computational linguistics is the natural language processing task of detecting and generating paraphrases. Applications
Paraphrasing (computational linguistics)
Paraphrasing_(computational_linguistics)
Cryptographic scheme
U_{k})\}_{k\in \mathbb {N} }} are equal, statistically close, or computationally indistinguishable. It is impossible to realize commitment schemes in the universal
Commitment_scheme
Cryptography based on quantum mechanical phenomena
Takeshi; Nishimura, Harumichi; Yamakami, Tomoyuki (2011). "Computational Indistinguishability Between Quantum States and its Cryptographic Application"
Quantum_cryptography
Study of stealing information securely and subliminally
attack, the outputs of the infected cryptosystem would be computationally indistinguishable from the outputs of the corresponding uninfected cryptosystem
Kleptography
Computer programming method for hashing
And cryptographic hash functions (which are designed to be computationally indistinguishable from truly random functions) are usually too slow to be used
Linear_probing
Collection of efficiently-computable functions which emulate a random oracle
{\displaystyle F_{n}} and R F n {\displaystyle RF_{n}} are computationally indistinguishable, where n is the security parameter. That is, for any adversary
Pseudorandom_function_family
Assumption used in cryptographic systems
The decisional Diffie–Hellman (DDH) assumption is a computational hardness assumption about a certain problem involving discrete logarithms in cyclic
Decisional Diffie–Hellman assumption
Decisional_Diffie–Hellman_assumption
Partition of a simple polygon into triangles
In computational geometry, polygon triangulation is the partition of a polygonal area (simple polygon) P into a set of triangles, i.e., finding a set
Polygon_triangulation
respectively computationally bounded adversary if the output of the simulator is statistically close to, respectively computationally indistinguishable from the
Secure_two-party_computation
Intelligence in machines
Artificial intelligence (AI) is the capability of computational systems to perform tasks typically associated with human intelligence, such as learning
Artificial_intelligence
Computational hardness assumption
The Decision Linear assumption (DLIN assumption) is a computational hardness assumption used in elliptic curve cryptography. In particular, the DLIN assumption
Decision_Linear_assumption
Unsolved problem in computer science
would lack the practical computational benefits of a proof that P = NP, but would represent a great advance in computational complexity theory and guide
P_versus_NP_problem
Cryptography method
is equivalent to another definition of security called ciphertext indistinguishability under chosen-plaintext attack (they used the term polynomial security)
Semantic_security
Assignment of colors to graph vertices that destroys all symmetries
Russell, Alexander; Sundaram, Ravi (1998), "A note on the asymptotics and computational complexity of graph distinguishability", Electronic Journal of Combinatorics
Distinguishing_coloring
particular, to Black-box obfuscation, proven to be impossible, and to Indistinguishability obfuscation, constructed recently under well-founded assumptions
White-box_cryptography
respectively. Roughly speaking, the computational security parameter is a measure for the input size of the computational problem on which the cryptographic
Security_parameter
Cyber attack whereby the attacker attempts to recover the key to an encryption scheme
Modern cryptography uses more robust notions of security. Recently, indistinguishability under adaptive chosen-ciphertext attack (IND-CCA2 security) has become
Key-recovery_attack
Unsolved problem in structural complexity theory
cryptography to model cryptographic hash functions that are computationally indistinguishable from random, and the construction of Kurtz et al. can be carried
Berman–Hartmanis_conjecture
Type of cryptographic security
is related with the concept of semantic security or indistinguishability used in the computational proof-based approach. Bruno Blanchet provides the following
Strong_secrecy
Cryptographic primitives that involve lattices
objects. These primitives include fully homomorphic encryption, indistinguishability obfuscation, cryptographic multilinear maps, and functional encryption
Lattice-based_cryptography
Average solution cost is the same with any method
In computational complexity and optimization the no free lunch theorem is a result that states that for certain types of mathematical problems, the computational
No free lunch in search and optimization
No_free_lunch_in_search_and_optimization
Thought experiment on artificial intelligence
computationalism: Mental states are computational states (which is why computers can have mental states and help to explain the mind); Computational states
Chinese_room
1950 scientific paper by Alan Turing
Harnad, Stevan (2001), "Minds, Machines, and Turing: The Indistinguishability of Indistinguishables", Journal of Logic, Language and Information, 9 (4): 425–445
Computing Machinery and Intelligence
Computing_Machinery_and_Intelligence
Cryptographic analysis
some notions of concrete security (left-or-right indistinguishability, real-or-random indistinguishability, find-then-guess security, and semantic-security)
Concrete_security
Hypothesis that reality could be a computer simulation
"consciousness-is-computation" version of computationalism and mathematical realism (or radical mathematical Platonism) are true, then consciousness is computation, which
Simulation_hypothesis
Cognitive science issue
Harnad, S. (2000). "Minds, Machines and Turing: The Indistinguishability of Indistinguishables". Journal of Logic, Language and Information. 9 (4): 425–445
Symbol_grounding_problem
Compact astronomical body
that share the same values for these properties, or parameters, are indistinguishable from one another. A related no-hair conjecture proposes that dynamic
Black_hole
Restricted model of non-universal quantum computation
Boson sampling is a computational task particularly friendly to quantum computers as opposed to classical computers. As explained by Philip Ball, it "entails
Boson_sampling
Field of study in artificial intelligence
where the addition of Laplace or Gaussian noise provides formal indistinguishability guarantees. Noise-based methods are typically combined with a fine-tuning
Machine_unlearning
Group intelligence that emerges from collective efforts
International Conference on Computational Collective Intelligence (ICCCI) is an established annual conference focusing on computational and applied aspects of
Collective_intelligence
American AI researcher and writer (born 1979)
objection that there are known limits to intelligent problem-solving from computational complexity theory; if there are strong limits on how efficiently algorithms
Eliezer_Yudkowsky
Test of a machine's ability to imitate human intelligence
answers resembled those of a human. Since the Turing test is a test of indistinguishability in performance capacity, the original (verbal) version generalizes
Turing_test
Form of artificial intelligence
the "imitation game", used to assess whether a machine can converse indistinguishably from a human) is not accurate or appropriate for testing whether an
Weak_artificial_intelligence
Public-key cryptosystem
{Decap} ({\mathit {sk}},c)=k} . Security of a KEM is quantified by its indistinguishability against adaptive chosen-ciphertext attack, IND-CCA, which is loosely
Key_encapsulation_mechanism
Concept in computer science
In computational complexity theory, a branch of computer science, bounded-error probabilistic polynomial time (BPP) is the class of decision problems
BPP_(complexity)
Clark (1954) were the first to use computational machines to simulate a Hebbian network. Other neural network computational machines were simulated by Nathaniel
History of artificial neural networks
History_of_artificial_neural_networks
Overview of and topical guide to natural language processing
of computational linguistics – interdisciplinary field dealing with the statistical or rule-based modeling of natural language from a computational perspective
Outline of natural language processing
Outline_of_natural_language_processing
Chemical compound
1002/anie.200602190. PMID 17001717. Datta, Ayan; Pati, Swapan K. (2007). "Computational design of high hydrogen adsorption efficiency in molecular "Sulflower""
Sulflower
Voice conversion software
that its generated voices sound near-indistinguishable from "real life", provided that sufficient computational specifications and resources (e.g., a
Retrieval-based Voice Conversion
Retrieval-based_Voice_Conversion
American computer scientist
The definition of differential privacy relies on the notion of indistinguishability of the outputs irrespective of whether an individual has contributed
Cynthia_Dwork
15th-century codex in an unknown script
University of Alberta, and his graduate student Bradley Hauer used computational linguistics in an attempt to decode the manuscript. Their findings were
Voynich_manuscript
Loss-of-control incident at OpenAI
access the Internet and breach the infrastructure of Hugging Face, a computational tools company. Contributing factors to the incident severity were a
OpenAI–HuggingFace_incident
Type of AI with wide-ranging abilities
wrote in 2007: "We cannot yet characterize in general what kinds of computational procedures we want to call intelligent." Researchers generally hold
Artificial general intelligence
Artificial_general_intelligence
Calculation of complex statistical distributions
integrals, for example in Bayesian statistics, computational physics, computational biology and computational linguistics. In Bayesian statistics, Markov
Markov_chain_Monte_Carlo
Asymmetric key encryption algorithm
definition of security achieved by Cramer–Shoup is formally termed "indistinguishability under adaptive chosen-ciphertext attack" (IND-CCA2). This security
Cramer–Shoup_cryptosystem
Convention for reporting statistical results
"Algorithms for compact letter displays: Comparison and evaluation". Computational Statistics & Data Analysis. 52 (2): 725–736. doi:10.1016/j.csda.2006
Compact_letter_display
algorithm C {\displaystyle C} is an Oblivious RAM (ORAM) compiler with computational overhead c ( ⋅ ) {\displaystyle c(\cdot )} and memory overhead m ( ⋅
Oblivious_RAM
Hypothetical process of digitally emulating a brain
substrate-neutral computational processes. Other scientists, including Roger Penrose, believe consciousness may emerge from some form of quantum computation that depends
Mind_uploading
Paradigm of quantum computer
phase shifters (this is also a starting point of boson sampling and of computational complexity analysis for LOQC). It points out that each U ( N ) {\displaystyle
Linear optical quantum computing
Linear_optical_quantum_computing
Deliberate creation of difficult-to-understand code
cryptographically hard. This is formalized in the many proposals for indistinguishability obfuscation, a cryptographic primitive that, if possible to build
Obfuscation_(software)
In computing, a condition where an expression does not have a correct value
Functions which terminate the computation, such as the exit system call. From within the program, this is indistinguishable from the preceding case, but
Undefined_value
Practice and study of secure communication techniques
Global surveillance – Mass surveillance across national borders Indistinguishability obfuscation – Type of cryptographic software obfuscation Information
Cryptography
Concept in programming language design
implementation, and are, in general, manipulable in the same way as, and fully indistinguishable from, ordinary language objects. Because of this, their usage generally
First-class_citizen
Thesis on the nature of computability
Janusz 2006:256. Gabbay 2001:284 Piccinini, Gualtiero (January 2007). "Computationalism, the Church–Turing Thesis, and the Church–Turing Fallacy". Synthese
Church–Turing_thesis
Any computer program for end-user use
game Personal computer game Simulation game Vehicle simulation game Computational science Social simulation Military simulation Flight simulator Driving
Application_software
List of concepts in artificial intelligence
computational cybernetics The integration of cybernetics and computational intelligence techniques. computational humor A branch of computational linguistics
Glossary of artificial intelligence
Glossary_of_artificial_intelligence
Method for bounding the errors of numerical computations
measurement errors and tolerances for components or due to limits on computational accuracy. Interval arithmetic also helps find guaranteed solutions to
Interval_arithmetic
2012 non-fiction book by Ray Kurzweil
the 2020s" computers will have "intelligence indistinguishable to biological humans". As computational power continues to grow, machine intelligence
How_to_Create_a_Mind
Israeli cryptographer (born 1966)
Halevi is a co-inventor of the first candidate general-purpose indistinguishability obfuscation schemes, with security based on a mathematical conjecture
Shai_Halevi
Class of artificial neural networks
update and message functions, respectively. Intuitively, in an MPNN computational block, graph nodes update their representations by aggregating the messages
Graph_neural_network
Type of abstract computing machine
machines, particularly in theoretical studies, help in understanding computational processes. The concept of register machines can also be applied to virtual
Register_machine
Attribution of human traits to AI
Meeting of the Association for Computational Linguistics (Volume 1: Long Papers). Dublin, Ireland: Association for Computational Linguistics: 298–307. doi:10
AI_anthropomorphism
Fewest cliques covering a graph's edges
Computational Statistics & Data Analysis, 52 (2): 725–736, doi:10.1016/j.csda.2006.09.035, MR 2418523 Opsut, Robert J. (1982), "On the computation of
Intersection number (graph theory)
Intersection_number_(graph_theory)
Formula to estimate the sine function
approximation formula is a rational expression in one variable for the computation of the approximate values of the trigonometric sines discovered by Bhāskara
Bhāskara I's sine approximation formula
Bhāskara_I's_sine_approximation_formula
Natural number
where the number of segments matches the number. This makes it often indistinguishable from the letter S. Higher segment displays may sometimes may make
5
Species of bacterium
genome is 6.9 kb long. Advances in systems biology have introduced computational modeling methods for studying the biology and pathogenesis of V. cholerae
Vibrio_cholerae
Cryptographic framework
protocol is indistinguishable from what can be computed by a simulator that only interacts with the ideal functionality. The computation model of universal
Universal_composability
Method of data analysis
defined above). This advantage, however, comes at the price of greater computational requirements if compared, for example, and when applicable, to the discrete
Principal_component_analysis
Digital image having no color information
lighter shades would be "wasted" by encoding a lot of perceptually-indistinguishable increments. Therefore, the shades are instead typically spread out
Grayscale
Thermodynamics Kinetic theory Particle statistics Spin–statistics theorem Indistinguishable particles Maxwell–Boltzmann Bose–Einstein Fermi–Dirac Parastatistics
Sznajd_model
Category of thought experiment
react exactly the way a "normal" human might. Outwardly, they are indistinguishable from "normal" humans. Canales, Jimena (August 9, 2022). Bedeviled:
Demon_(thought_experiment)
Function and primitive data structure in Lisp and other functional programming languages
because it renders cons cells indistinguishable from any other Scheme procedure, as well as introduces unnecessary computational inefficiencies. However, the
Cons
Relation between sets of properties or facts
properties. Then: If two persons are indistinguishable in all of their physical properties, they must also be indistinguishable in all of their mental properties
Supervenience
Italian-American computer scientist (born 1954)
functions, digital signatures, oblivious transfer, secure multiparty computation, and is one of the co-inventors of zero-knowledge proofs. While a graduate
Silvio_Micali
Region of chromaticity diagram
study also builds a computational model that predicts the ellipse shape given the test color and the eccentricity. The computational model is then used
MacAdam_ellipse
psychology, cognitive neuroscience and the philosophical schools of computationalism and functionalism. All these fields used related tools to model the
History of artificial intelligence
History_of_artificial_intelligence
Task of transforming a deterministic finite automaton
states can be given different names). The minimal DFA ensures minimal computational cost for tasks such as pattern matching. There are three classes of
DFA_minimization
Value for unrepresentable data
can support advanced features such as mixing numerical and symbolic computation or other extensions to basic floating-point arithmetic. In floating-point
NaN
Blockchain computing platform
blockchain utilizing the Ethash algorithm family. This increase in computational power indicates greater participation by miners, broader network adoption
Ethereum_Classic
Method of quantum computing
199. arXiv:quant-ph/0508124. R. Raussendorf; H. J. Briegel (2002). "Computational model underlying the one-way quantum computer". arXiv:quant-ph/0108067
One-way_quantum_computer
Mathematical theory of the geometry of space and time
equivalence principle, which states that the effects of gravity are indistinguishable from those of acceleration in sufficiently small regions of space
Curved_spacetime
Process of converting plaintext to ciphertext
Encrypted function Enigma machine Export of cryptography Geo-blocking Indistinguishability obfuscation Key management List of cryptography software Multiple
Encryption
Operating system designed to operate on multiple systems over a network computer
independent software, networked, communicating, and physically separate computational nodes. They handle jobs which are serviced by multiple CPUs. Each individual
Distributed_operating_system
Computer security attack
Covert channel must be measurable by the intended recipient only. Indistinguishability: Covert channel must lack identification. Bandwidth: number of data
Covert_channel
Condition of granules or grains
larger entity is subdivided, or the extent to which groups of smaller indistinguishable entities have joined together to become larger distinguishable entities
Granularity
Software agent that communicates on social media
the scammer is in fact a trusted user. Social bots can be a tool for computational propaganda. Bots can also be used for algorithmic curation, algorithmic
Social_bot
2019 text-generating language model
challenges, evaluations and pitfalls (PDF). 13th International Conference on Computational Creativity (ICCC'22). Ohlheiser, Abby; Hao, Karen (26 February 2021)
GPT-2
travel, tourism, insurance
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
COMPUTATIONAL INDISTINGUISHABILITY
travel, tourism, insurance