Secure Multi-party Shuffling (Q3460735)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Secure Multi-party Shuffling	scientific article

Statements

scholarly article

0 references

Secure Multi-party Shuffling (English)

0 references

Mahnush Movahedi

0 references

0 references

0 references

Structural Information and Communication Complexity

0 references

publication date

8 January 2016

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-319-25258-2_32

0 references

How to Shuffle in Public

0 references

Sorting in \(c \log n\) parallel steps

0 references

A full proof of the BGW protocol for perfectly secure multiparty computation

0 references

Financial Cryptography

0 references

Communication Locality in Secure Multi-party Computation

0 references

Fast byzantine agreement

0 references

The dining cryptographers problem: Unconditional sender and recipient untraceability

0 references

Theory of Cryptography

0 references

Brief announcement

0 references

Simplified VSS and fast-track multiparty computations with applications to threshold cryptography

0 references

Software protection and simulation on oblivious RAMs

0 references

Advances in Cryptology - EUROCRYPT 2004

0 references

Randomized Shellsort

0 references

Practically Efficient Multi-party Sorting Protocols from Comparison Sort Algorithms

0 references

Cryptographic defense against traffic analysis

0 references

A Permutation Network

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-319-25258-2_32

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:3460735

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