Sciweavers

436 search results - page 34 / 88
» Using trust assumptions with security requirements
Sort
View
CRYPTO
2000
Springer
122views Cryptology» more  CRYPTO 2000»
15 years 7 months ago
Efficient Non-malleable Commitment Schemes
We present efficient non-malleable commitment schemes based on standard assumptions such as RSA and Discrete-Log, and under the condition that the network provides publicly availab...
Marc Fischlin, Roger Fischlin
ACSAC
2000
IEEE
15 years 8 months ago
Fair On-line Gambling
This paper proposes a fair electronic gambling scheme for the Internet. The proposed scheme provides a unique link between payment and gambling outcome so that the winner can be e...
Weiliang Zhao, Vijay Varadharajan, Yi Mu
HPDC
2010
IEEE
15 years 5 months ago
Mendel: efficiently verifying the lineage of data modified in multiple trust domains
Data is routinely created, disseminated, and processed in distributed systems that span multiple administrative domains. To maintain accountability while the data is transformed b...
Ashish Gehani, Minyoung Kim
ICQNM
2008
IEEE
201views Chemistry» more  ICQNM 2008»
15 years 10 months ago
Loss-Tolerant Quantum Coin Flipping
Coin flipping is a cryptographic primitive in which two spatially separated players, who in principle do not trust each other, wish to establish a common random bit. If we limit ...
Guido Berlín, Gilles Brassard, Félix...
CN
2006
66views more  CN 2006»
15 years 4 months ago
Secure acknowledgment aggregation and multisignatures with limited robustness
In certain reliable group-oriented and multicast applications, a source needs to securely verify whether all (and if not all, which) intended receivers have received a message. How...
Claude Castelluccia, Stanislaw Jarecki, Jihye Kim,...