Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/inderscience-publishers/fair-threshold-decryption-with-semi-trusted-third-parties-rja6bXTQcL
References (41)
-
D. Chaum, C. Crépeau, I. Damgård (1988)
Multiparty unconditionally secure protocols -
(2000)
Secure multi-party computation (working draft, version 1.2)’, available at http://www.wisdom.weizmann.ac.il/oded/pp.html -
Y. Desmedt, Y. Frankel (1989)
Threshold Cryptosystems -
R. Gennaro, Stanislaw Jarecki, H. Krawczyk, T. Rabin (1999)
Secure Distributed Key Generation for Discrete-Log Based CryptosystemsJournal of Cryptology, 20
-
Pierre-Alain Fouque, G. Poupard, J. Stern (2000)
Sharing Decryption in the Context of Voting or Lotteries -
Y. Dodis, P. Lee, Dae Yum (2007)
Optimistic Fair Exchange in a Multi-user SettingJ. Univers. Comput. Sci., 14
-
V. Shoup (2000)
Practical Threshold Signatures -
R. Gennaro, Stanislaw Jarecki, H. Krawczyk, T. Rabin (1996)
Robust Threshold DSS SignaturesInf. Comput., 164
-
M. Ben-Or, Oded Goldreich, S. Micali, R. Rivest (1990)
A fair protocol for signing contractsIEEE Trans. Inf. Theory, 36
-
Y. Dodis, L. Reyzin (2003)
Breaking and repairing optimistic fair exchange from PODC 2003 -
M. Luby, S. Micali, C. Rackoff (1983)
How to simultaneously exchange a secret bit by flipping a symmetrically-biased coin24th Annual Symposium on Foundations of Computer Science (sfcs 1983)
-
A. Shamir (1979)
How to share a secretCommun. ACM, 22
-
Oded Goldreich, S. Micali, A. Wigderson (1987)
How to play ANY mental gameProceedings of the nineteenth annual ACM symposium on Theory of computing
-
Fabrice Boudot, Berry Schoenmakers, Jacques Traoré (2001)
A fair and efficient solution to the socialist millionaires' problemDiscret. Appl. Math., 111
-
Lea Kissner, D. Song (2005)
Privacy-Preserving Set Operations -
M. Blum (1983)
How to exchange (secret) keysACM Trans. Comput. Syst., 1
-
J. Garay, P. MacKenzie, M. Prabhakaran, Ke Yang (2011)
Resource Fairness and Composability of Cryptographic ProtocolsJournal of Cryptology, 24
-
D. Boneh, M. Naor (2000)
Timed Commitments -
C. Cachin, J. Camenisch (2000)
Optimistic Fair Secure Computation -
Benjamin Cox (1995)
NetBill Security and Transaction Protocol -
Andrew Lindell (2008)
Legally-Enforceable Fairness in Secure Two-Party Computation -
T. Rabin, M. Ben-Or (1989)
Verifiable secret sharing and multiparty protocols with honest majority -
R. Gennaro, S. Halevi, H. Krawczyk, T. Rabin (2008)
Threshold RSA for Dynamic and Ad-Hoc GroupsIACR Cryptol. ePrint Arch., 2008
-
M. Franklin, M. Reiter (1997)
Fair Exchange with a Semi-Trusted Third Party (extended abstract) -
M. Lepinski, S. Micali, Chris Peikert, Abhi Shelat (2004)
Completely fair SFE and coalition-safe cheap talk -
R. Gennaro, T. Rabin, Stanislaw Jarecki, H. Krawczyk (2000)
Robust and Efficient Sharing of RSA FunctionsJournal of Cryptology, 13
-
M. Ben-Or, S. Goldwasser, A. Wigderson (1988)
Completeness theorems for non-cryptographic fault-tolerant distributed computation -
Jianying Zhou, R. Deng, F. Bao (2000)
Some Remarks on a Fair Exchange Protocol -
Research Division, Almaden bullet, T. Watson, bullet Tokyo, bullet Zurich, N. Asokan, M. Schunter, Univ Hildesheim, Michael Waidner (1997)
Optimistic protocols for fair exchange -
S. Gordon, Carmit Hazay, Jonathan Katz, Yehuda Lindell (2011)
Complete Fairness in Secure Two-Party ComputationJ. ACM, 58
-
R. Cleve (1986)
Limits on the security of coin flips when half the processors are faulty -
N. Asokan, V. Shoup, M. Waidner (2000)
Optimistic fair exchange of digital signaturesIEEE Journal on Selected Areas in Communications, 18
-
Jianying Zhou, D. Gollmann (1997)
An efficient non-repudiation protocolProceedings 10th Computer Security Foundations Workshop
-
J. Camenisch, V. Shoup (2003)
Practical Verifiable Encryption and Decryption of Discrete LogarithmsIACR Cryptol. ePrint Arch., 2002
-
T. Elgamal (1984)
A public key cryptosystem and a signature scheme based on discrete logarithms -
D. Boneh, Craig Gentry, Ben Lynn, H. Shacham (2003)
Aggregate and Verifiably Encrypted Signatures from Bilinear Maps -
Benny Pinkas (2003)
Fair Secure Two-Party Computation -
A. Santis, Y. Desmedt, Y. Frankel, M. Yung (1994)
How to share a function securely -
Taher Gamal (1984)
A public key cryptosystem and a signature scheme based on discrete logarithmsIEEE Trans. Inf. Theory, 31
-
F. Bao, R. Deng, W. Mao (1998)
Efficient and practical fair exchange protocols with off-line TTPProceedings. 1998 IEEE Symposium on Security and Privacy (Cat. No.98CB36186)
-
J. Garay, P. MacKenzie, Ke Yang (2004)
Efficient and Secure Multi-Party Computation with Faulty Majority and Complete FairnessIACR Cryptol. ePrint Arch., 2004
- Publisher
- Inderscience Publishers
- Copyright
- Copyright © Inderscience Enterprises Ltd. All rights reserved
- ISSN
- 1753-0563
- eISSN
- 1753-0571
- DOI
- 10.1504/IJACT.2010.038307
- Publisher site
- See Article on Publisher Site
Abstract
A threshold decryption scheme is a multi-party public key cryptosystem that allows any sufficiently large subset of participants to decrypt a ciphertext, but disallows the decryption otherwise. Many threshold cryptographic schemes have been proposed so far, but fairness is not generally considered in this earlier work. In this paper, we present fair threshold decryption schemes, where either all of the participants can decrypt or none of them can. Our solutions employ semi-trusted third parties (STTP) and offline semi-trusted third parties (OTTP) previously used for fair exchange. We consider a number of variants of our schemes to address realistic alternative trust scenarios. Although we describe our schemes using a simple hashed version of ElGamal encryption, our methods generalise to other threshold decryption schemes and threshold signature schemes as well.
Journal
International Journal of Applied Cryptography – Inderscience Publishers
Published: Jan 1, 2010