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 non-interactive secure computation - MaRDI portal

Concurrently composable non-interactive secure computation (Q6135409)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7731527

Language	Label	Description	Also known as
English	Concurrently composable non-interactive secure computation	scientific article; zbMATH DE number 7731527

Statements

scholarly article

0 references

Concurrently composable non-interactive secure computation (English)

0 references

0 references

0 references

Advances in Cryptology – ASIACRYPT 2022

0 references

publication date

25 August 2023

0 references

zbMATH Keywords

secure two-party computation

0 references

non-interactive secure computation protocols

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-031-22963-3_18

0 references

From Selective to Adaptive Security in Functional Encryption

0 references

Two-message witness indistinguishability and secure computation in the plain model from new assumptions

0 references

Round optimal concurrent MPC via strong simulation

0 references

0 references

\(k\)-round multiparty computation from \(k\)-round oblivious transfer via garbled interactive circuits

0 references

Two-round adaptively secure multiparty computation from standard assumptions

0 references

One-message zero knowledge and non-malleable commitments

0 references

Two-message statistically sender-private OT from LWE

0 references

Minimum disclosure proofs of knowledge

0 references

Security and composition of multiparty cryptographic protocols

0 references

Universally Composable Security with Global Setup

0 references

0 references

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

0 references

Two-round oblivious transfer from CDH or LPN

0 references

0 references

Witness encryption and its applications

0 references

Concurrently Secure Computation in Constant Rounds

0 references

On the Exact Round Complexity of Self-composable Two-Party Computation

0 references

Two-round multiparty secure computation from minimal assumptions

0 references

Foundations of Cryptography

0 references

Definitions and properties of zero-knowledge proof systems

0 references

0 references

The Knowledge Complexity of Interactive Proof Systems

0 references

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

0 references

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

0 references

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

0 references

Output-Compressing Randomized Encodings and Applications

0 references

Two-Round and Non-Interactive Concurrent Non-Malleable Commitments from Time-Lock Puzzles

0 references

Concurrent Non-malleable Commitments from Any One-Way Function

0 references

A unified framework for concurrent security

0 references

Theory of Cryptography

0 references

Theory of Cryptography

0 references

Succinct non-interactive secure computation

0 references

Adaptive One-Way Functions and Applications

0 references

0 references

New notions of security

0 references

0 references

Round Optimal Blind Signatures

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-031-22963-3_18

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6135409

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