2967 search results - page 459 / 594 » Cryptology |
159
click to vote
CTRSA
2009
Springer
16 years 5 days ago
2009
Springer
In the setting of multiparty computation a set of parties with private inputs wish to compute some joint function of their inputs, whilst preserving certain security properties (l...
119
click to vote
CTRSA
2009
Springer
16 years 5 days ago
2009
Springer
Zero-knowledge set is a primitive introduced by Micali, Rabin, and Kilian (FOCS 2003) which enables a prover to commit a set to a verifier, without revealing even the size of the...
154
Voted
CTRSA
2009
Springer
16 years 5 days ago
2009
Springer
Abstract. A redactable signature scheme for a string of objects supports verification even if multiple substrings are removed from the original string. It is important that the re...
171
click to vote
ASIACRYPT
2009
Springer
15 years 12 months ago
2009
Springer
Multi-party secure computations are general important procedures to compute any function while keeping the security of private inputs. In this work we ask whether preprocessing can...
160
Voted
ASIACRYPT
2009
Springer
15 years 12 months ago
2009
Springer
Non-malleability is an interesting and useful property which ensures that a cryptographic protocol preserves the independence of the underlying values: given for example an encryp...