Post-quantum multi-party computation (Q2056694)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Post-quantum multi-party computation	scientific article

Statements

scholarly article

0 references

Post-quantum multi-party computation (English)

0 references

0 references

0 references

0 references

Dakshita Khurana

0 references

Giulio Malavolta

0 references

publication date

8 December 2021

0 references

full work available at URL

https://arxiv.org/abs/2005.12904

0 references

MaRDI profile type

MaRDI publication profile

0 references

Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE

0 references

Statistical ZAP arguments

0 references

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

0 references

Weak zero-knowledge beyond the black-box barrier

0 references

One-message zero knowledge and non-malleable commitments

0 references

Post-quantum zero knowledge in constant rounds

0 references

Quantum FHE (almost) as secure as classical

0 references

Four round secure computation without setup

0 references

Quantum Homomorphic Encryption for Circuits of Low T-gate Complexity

0 references

Concurrent Non-Malleable Commitments (and More) in 3 Rounds

0 references

Four-round concurrent non-malleable commitments from one-way functions

0 references

Multi-identity and Multi-key Leveled FHE from Learning with Errors

0 references

Secure multi-party quantum computation

0 references

Quantum-Secure Coin-Flipping and Applications

0 references

Spooky Encryption and Its Applications

0 references

Secure multi-party quantum computation with a dishonest majority

0 references

Quantum Homomorphic Encryption for Polynomial-Sized Circuits

0 references

Secure Two-Party Quantum Evaluation of Unitaries against Specious Adversaries

0 references

Actively Secure Two-Party Evaluation of Any Quantum Operation

0 references

The Exact Round Complexity of Secure Computation

0 references

Two-round multiparty secure computation from minimal assumptions

0 references

Fully homomorphic encryption using ideal lattices

0 references

Trapdoors for hard lattices and new cryptographic constructions

0 references

Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based

0 references

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

0 references

On perfect correctness in (lockable) obfuscation

0 references

Constant round non-malleable protocols using one way functions

0 references

Textbook non-malleable commitments

0 references

Classical Cryptographic Protocols in a Quantum World

0 references

Statistical witness indistinguishability (and more) in two messages

0 references

0 references

Round optimal concurrent non-malleability from polynomial hardness

0 references

Non-malleability amplification

0 references

Constant-round non-malleable commitments from any one-way function

0 references

Concurrent Non-malleable Commitments from Any One-Way Function

0 references

Parallel coin-tossing and constant-round secure two-party computation

0 references

On-the-fly multiparty computation on the cloud via multikey fully homomorphic encryption

0 references

Fully Simulatable Quantum-Secure Coin-Flipping and Applications

0 references

Two Round Multiparty Computation via Multi-key FHE

0 references

Adaptive One-Way Functions and Applications

0 references

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

0 references

New and Improved Constructions of Nonmalleable Cryptographic Protocols

0 references

Constant-Round Non-malleable Commitments from Sub-exponential One-Way Functions

0 references

Multi-key FHE from LWE, Revisited

0 references

Noninteractive zero knowledge for NP from (Plain) Learning With Errors

0 references

A Framework for Efficient and Composable Oblivious Transfer

0 references

Quantum Proofs of Knowledge

0 references

Zero-knowledge against quantum attacks

0 references

Identifiers

10.1007/978-3-030-77870-5_16

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:2056694

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