Results 1  10
of
541,996
How to Go Beyond the BlackBox Simulation Barrier
 In 42nd FOCS
, 2001
"... The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary’s algorithm as a blackbox. We present t ..."
Abstract

Cited by 240 (13 self)
 Add to MetaCart
The simulation paradigm is central to cryptography. A simulator is an algorithm that tries to simulate the interaction of the adversary with an honest party, without knowing the private input of this honest party. Almost all known simulators use the adversary’s algorithm as a blackbox. We present
The RoundComplexity of BlackBox Concurrent ZeroKnowledge
, 2003
"... Zeroknowledge proof systems are interactive protocols that enable one party, called the prover, to convince another party, called the verifier, in the truth of a statement without revealing anything beyond the validity of the assertion being proved. Besides being fascinating on their own right, zer ..."
Abstract

Cited by 7 (0 self)
 Add to MetaCart
in the era of the Internet, is one that allows the concurrent execution of zeroknowledge protocols. The most common technique for proving the zeroknowledge property of a protocol is called blackbox simulation. As it turns out, the usage of blackbox simulation in the concurrent setting introduces many
On the Composition of ZeroKnowledge Proof Systems
 SIAM Journal on Computing
, 1990
"... : The wide applicability of zeroknowledge interactive proofs comes from the possibility of using these proofs as subroutines in cryptographic protocols. A basic question concerning this use is whether the (sequential and/or parallel) composition of zeroknowledge protocols is zeroknowledge too. We ..."
Abstract

Cited by 214 (15 self)
 Add to MetaCart
. We demonstrate the limitations of the composition of zeroknowledge protocols by proving that the original definition of zeroknowledge is not closed under sequential composition; and that even the strong formulations of zeroknowledge (e.g. blackbox simulation) are not closed under parallel
Inside the black box: Raising standards through classroom assessment
 Phi Delta Kappan
, 1998
"... Raising the standards of learning that are achieved through school education is an important national priority. Governments have been vigorous in the last ten years in making changes in pursuit of this aim. National curriculum testing, the development of the GCSE, league tables of school performance ..."
Abstract

Cited by 533 (7 self)
 Add to MetaCart
this task more effectively—what is missing from the policies is any direct help with this task. In terms of systems engineering, present policy seems to treat the classroom as a bla k box. Certain inputs from the outside are fed in or make demands—pupils, teachers, other resources, management rules
Random Oracles are Practical: A Paradigm for Designing Efficient Protocols
, 1995
"... We argue that the random oracle model  where all parties have access to a public random oracle  provides a bridge between cryptographic theory and cryptographic practice. In the paradigm we suggest, a practical protocol P is produced by first devising and proving correct a protocol P R for the ..."
Abstract

Cited by 1643 (75 self)
 Add to MetaCart
encryption, signatures, and zeroknowledge proofs.
NonMalleable Cryptography
 SIAM Journal on Computing
, 2000
"... The notion of nonmalleable cryptography, an extension of semantically secure cryptography, is defined. Informally, in the context of encryption the additional requirement is that given the ciphertext it is impossible to generate a different ciphertext so that the respective plaintexts are related. ..."
Abstract

Cited by 490 (21 self)
 Add to MetaCart
. The same concept makes sense in the contexts of string commitment and zeroknowledge proofs of possession of knowledge. Nonmalleable schemes for each of these three problems are presented. The schemes do not assume a trusted center; a user need not know anything about the number or identity of other
BlackBox Computational ZeroKnowledge Proofs, Revisited: The SimulationExtraction Paradigm
"... Abstract. The concept of zeroknowledge proofs has been around for about 25 years. It has been redefined over and over to suit the special security requirements of protocols and systems. Common among all definitions is the requirement of the existence of some efficient “device ” simulating the view ..."
Abstract
 Add to MetaCart
the definition of “blackbox computational ” zeroknowledge, in which there exists one simulator for all verifiers, the simulator has blackbox access to the verifier, and the quality of simulation is such that the real and simulated views cannot be distinguished by polynomial tests (computational
Blind Signal Separation: Statistical Principles
, 2003
"... Blind signal separation (BSS) and independent component analysis (ICA) are emerging techniques of array processing and data analysis, aiming at recovering unobserved signals or `sources' from observed mixtures (typically, the output of an array of sensors), exploiting only the assumption of mut ..."
Abstract

Cited by 522 (4 self)
 Add to MetaCart
of mutual independence between the signals. The weakness of the assumptions makes it a powerful approach but requires to venture beyond familiar second order statistics. The objective of this paper is to review some of the approaches that have been recently developed to address this exciting problem
BlackBox NonBlackBox Zero Knowledge
"... Motivated by theoretical and practical interest, the challenging task of designing cryptographic protocols having only blackbox access to primitives has generated various breakthroughs in the last decade. Despite such positive results, even though nowadays we know blackbox constructions for secu ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
Sasson et al. [STOC 2004], together with a blackbox publiccoin witness indistinguishable universal argument that we construct along the way. Additionally we show the first blackbox construction of a generalization of zeroknowledge sets introduced by Micali et al. [FOCS 2003]. The generalization that we
A threat in the air: How stereotypes shape intellectual identity and performance
 American Psychologist
, 1997
"... A general theory of domain identification is used to describe achievement barriers still faced by women in advanced quantitative areas and by African Americans in school. The theory assumes that sustained school success requires identification with school and its subdomains; that societal pressures ..."
Abstract

Cited by 639 (10 self)
 Add to MetaCart
A general theory of domain identification is used to describe achievement barriers still faced by women in advanced quantitative areas and by African Americans in school. The theory assumes that sustained school success requires identification with school and its subdomains; that societal pressures
Results 1  10
of
541,996