Resettably Secure Computation (Q3627427)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Resettably Secure Computation	scientific article

Statements

scholarly article

0 references

Resettably Secure Computation (English)

0 references

0 references

0 references

Advances in Cryptology - EUROCRYPT 2009

0 references

publication date

12 May 2009

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1007/978-3-642-01001-9_3

0 references

Security and composition of multiparty cryptographic protocols

0 references

0 references

Resettable zero-knowledge (extended abstract)

0 references

New Constructions for UC Secure Computation Using Tamper-Proof Hardware

0 references

On the limitations of universally composable two-party computation without set-up assumptions

0 references

Instance-Dependent Verifiable Random Functions and Their Application to Simultaneous Resettability

0 references

Zaps and Their Applications

0 references

0 references

Differential Privacy: A Survey of Results

0 references

Universally Composable Multi-party Computation Using Tamper-Proof Hardware

0 references

Concurrent and resettable zero-knowledge in poly-loalgorithm rounds

0 references

Bounded-concurrent secure two-party computation without setup assumptions

0 references

Theory of Cryptography

0 references

Local zero knowledge

0 references

How to share a secret

0 references

Generic and Practical Resettable Zero-Knowledge in the Bare Public-Key Model

0 references

Identifiers

zbMATH Open document ID

0 references

10.1007/978-3-642-01001-9_3

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:3627427

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