Deprecated: $wgMWOAuthSharedUserIDs=false is deprecated, set $wgMWOAuthSharedUserIDs=true, $wgMWOAuthSharedUserSource='local' instead [Called from MediaWiki\HookContainer\HookContainer::run in /var/www/html/w/includes/HookContainer/HookContainer.php at line 135] in /var/www/html/w/includes/Debug/MWDebug.php on line 372
Concurrently Composable Security with Shielded Super-Polynomial Simulators - MaRDI portal

Concurrently Composable Security with Shielded Super-Polynomial Simulators (Q5738883)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 6729671

Language	Label	Description	Also known as
English	Concurrently Composable Security with Shielded Super-Polynomial Simulators	scientific article; zbMATH DE number 6729671

Statements

scholarly article

0 references

Concurrently Composable Security with Shielded Super-Polynomial Simulators (English)

0 references

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-56620-7_13

0 references

0 references

Advances in Cryptology – CRYPTO 2004

0 references

Universally composable two-party and multi-party secure computation

0 references

Universally Composable Security with Global Setup

0 references

0 references

Concurrent Secure Computation with Optimal Query Complexity

0 references

0 references

Adaptive Hardness and Composable Security in the Plain Model from Standard Assumptions

0 references

Adaptive and Concurrent Secure Computation from New Adaptive, Non-malleable Commitments

0 references

Nonmalleable Cryptography

0 references

Unconditionally Secure and Universally Composable Commitments from Physical Assumptions

0 references

A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithms

0 references

Concurrently Secure Computation in Constant Rounds

0 references

What Information Is Leaked under Concurrent Composition?

0 references

On Concurrently Secure Computation in the Multiple Ideal Query Model

0 references

Password-Authenticated Session-Key Generation on the Internet in the Plain Model

0 references

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

0 references

On Black-Box Complexity of Universally Composable Security in the CRS Model

0 references

Composable Adaptive Secure Protocols Without Setup Under Polytime Assumptions

0 references

Universally Composable Multi-party Computation Using Tamper-Proof Hardware

0 references

Round-Efficient Black-Box Construction of Composable Multi-Party Computation

0 references

Impossibility results for universal composability in public-key models and with fixed inputs

0 references

Concurrent composition of secure protocols in the timing model

0 references

Constant-Round Black-Box Construction of Composable Multi-Party Computation Protocol

0 references

Non-malleability amplification

0 references

Black-Box Constructions of Composable Protocols without Set-Up

0 references

A unified framework for concurrent security

0 references

A Unified Framework for UC from Only OT

0 references

Theory of Cryptography

0 references

0 references

Cryptographic Complexity of Multi-Party Computation Problems: Classifications and Separations

0 references

New notions of security

0 references

On Adaptively Secure Protocols

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-56620-7_13

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5738883

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5738883&oldid=36327075"