Magic Adversaries Versus Individual Reduction: Science Wins Either Way (Q5738980)

scientific article; zbMATH DE number 6729788

Language	Label	Description	Also known as
English	Magic Adversaries Versus Individual Reduction: Science Wins Either Way	scientific article; zbMATH DE number 6729788

Statements

instance of

scholarly article

0 references

title

Magic Adversaries Versus Individual Reduction: Science Wins Either Way (English)

0 references

author

Yi Deng

0 references

published in

Lecture Notes in Computer Science

0 references

publication date

13 June 2017

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-56614-6_12

0 references

cites work

Notions of Black-Box Reductions, Revisited

0 references

On the existence of extractable one-way functions

0 references

Q4249337

0 references

On Non-Black-Box Simulation and the Impossibility of Approximate Obfuscation

0 references

Limits of Constructive Security Proofs

0 references

Theory of Cryptography

0 references

Black-box concurrent zero-knowledge requires \tilde {Ω} (log <i>n</i> ) rounds

0 references

On the power of nonuniformity in proofs of security

0 references

Universally composable two-party and multi-party secure computation

0 references

Public-Coin Concurrent Zero-Knowledge in the Global Hash Model

0 references

Constant-Round Concurrent Zero-Knowledge from Indistinguishability Obfuscation

0 references

From Weak to Strong Zero-Knowledge and Applications

0 references

Q4035738

0 references

On the Implausibility of Constant-Round Public-Coin Zero-Knowledge Proofs

0 references

Resolving the Simultaneous Resettability Conjecture and a New Non-Black-Box Simulation Strategy

0 references

New directions in cryptography

0 references

Magic Functions

0 references

Q4542559

0 references

Towards Non-Black-Box Separations of Public Key Encryption and One Way Function

0 references

Q3210166

0 references

What Information Is Leaked under Concurrent Composition?

0 references

Concurrently Secure Computation in Constant Rounds

0 references

Concurrent Secure Computation via Non-Black Box Simulation

0 references

How to construct constant-round zero-knowledge proof systems for NP

0 references

Round-Efficient Concurrently Composable Secure Computation via a Robust Extraction Lemma

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

On Yao’s XOR-Lemma

0 references

A uniform-complexity treatment of encryption and zero-knowledge

0 references

Foundations of Cryptography

0 references

Non-black-box simulation in the fully concurrent setting

0 references

A Pseudorandom Generator from any One-way Function

0 references

Practical chosen ciphertext secure encryption from factoring

0 references

Q3549591

0 references

General Hardness Amplification of Predicates and Puzzles

0 references

Q5750403

0 references

Q3191615

0 references

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

0 references

Bounded-concurrent secure two-party computation without setup assumptions

0 references

Lower bounds and impossibility results for concurrent self composition

0 references

Bounded-concurrent secure multi-party computation with a dishonest majority

0 references

Obfuscation-Based Non-black-box Simulation and Four Message Concurrent Zero Knowledge for NP

0 references

On lattices, learning with errors, random linear codes, and cryptography

0 references

A method for obtaining digital signatures and public-key cryptosystems

0 references

Theory of Cryptography

0 references

Identifiers

zbMATH Open document ID

1415.94422

0 references

DOI

10.1007/978-3-319-56614-6_12

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738980