84 search results - page 13 / 17 » On the Security Loss in Cryptographic Reductions |
ICALP
2005
Springer
15 years 3 months ago
2005
Springer
We present a new primitive—Append-only Signatures (AOS)—with the property that any party given an AOS signature Sig[M1] on message M1 can compute Sig[M1 M2] for any message M2...
ASIACRYPT
2006
Springer
15 years 1 months ago
2006
Springer
Non-interactive zero-knowledge proofs play an essential role in many cryptographic protocols. We suggest several NIZK proof systems based on prime order groups with a bilinear map...
FFA
2006
14 years 9 months ago
2006
We consider the problem of increasing the threshold parameter of a secret-sharing scheme after the setup (share distribution) phase, without further communication between the deal...
107
click to vote
CRYPTO
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. Let A and B denote cryptographic primitives. A (k, m)robust A-to-B combiner is a construction, which takes m implementations of primitive A as input, and yields an implem...
SASN
2006
ACM
15 years 3 months ago
2006
ACM
In a large sensor network, in-network data aggregation, i.e., combining partial results at intermediate nodes during message routing, significantly reduces the amount of communic...