J. Benaloh. Secret sharing homomorphisms: Keeping shares of a secret secret. In Advances in Cryptology - Proceedings of the 13th Annual International Cryptology Conference 215 (CRYPTO), volume 263 of Lecture Notes in Computer Science (LNCS), pages 251--260. Springer, 1987. Home/Search Document Not in Database Context Related Articles Check |
This paper is cited by the following papers:
First 50 documents Next 50
On Verifiable Function Sharing - Blunden (Correct)
How to Prove All NP Statements in Zero-Knowledge and a.. - Goldreich, al. (1998) (17 citations) (Correct)
Privacy-preserving Distributed Mining of Association Rules .. - Kantarcioglu, Clifton (2002) (31 citations) (Correct)
Verifiable Secret Redistribution for archive systems - Wong, Wang, Wing (2002) (2 citations) (Correct)
Reshufflable And laziness tolerant mental card game protocol - Kurosawa, Katayama, Ogata (1997) (Correct)
Verifiable Secret Redistribution for Threshold Sharing Schemes - Wong, Wang, Wing (2002) (1 citation) (Correct)
A Simple Publicly Verifiable Secret Sharing Scheme and its.. - Schoenmakers (1999) (17 citations) (Correct)
Crypto Topics And Applications II - Seberry, Charnes, Pieprzyk.. (Correct)
Discrete Structures in the Theory of Secret Sharing - Martin (1991) (12 citations) (Correct)
Towards Fault-Tolerant and Secure On-Line Services - Zhou (2001) (3 citations) (Correct)
Verifiable Secret Redistribution - Wong, Wing (2001) (Correct)
Some Recent Research Aspects of Threshold Cryptography - Desmedt (1997) (18 citations) (Correct)
Efficient Generation of Shared RSA keys - Boneh, Franklin (1997) (51 citations) (Correct)
Cryptology - Rivest (Correct)
Electronic Voting Schemes - Mürk (2000) (Correct)
Efficient Generation of Shared RSA keys - Boneh, Franklin (1997) (51 citations) (Correct)
Computing Functions Of A Shared Secret - Beimel, Burmester, Desmedt.. (2000) (2 citations) (Correct)
Experimenting with Shared Generation of RSA keys - Malkin, Wu, Boneh (1999) (21 citations) (Correct)
A Communication-Privacy Tradeoff for Modular Addition - Chor, Kushilevitz (1993) (5 citations) (Correct)
Reshufflable and Laziness Tolerant Mental Card Game Protocol - Kaoru Kurosawa (1997) (Correct)
Aspects Of Group Communications Security - Hassler (1995) (Correct)
How to Solve any Protocol Problem - Goldreich Silvio (1987) (2 citations) (Correct)
A Zero-One Law for Boolean Privacy - Chor, Kushilevitz (1991) (41 citations) (Correct)
On the Structure of the Privacy Hierarchy - Chor, Geréb-Graus.. (1994) (7 citations) (Correct)
Unconditional Privacy in Social Choice - Felix Brandt Computer (Correct)
General Secret Sharing Based on the Chinese - Remainder Theorem Sorin (2006) (Correct)
Verifiable Secret Redistribution - Theodore Wong Jeannette (Correct)
Unknown - (Correct)
Verifiable Secret Redistribution for - Threshold Sharing Schemes (Correct)
Secure Distributed Data-Mining and Its Application to.. - Roughan, Zhang (2006) (Correct)
Batch Verification of Validity of Bids in - Homomorphic Auction Kun (2005) (Correct)
Verifiable Threshold Sharing of a Large Secret Safe-Prime - Maged Hamada Ibrahim (2005) (Correct)
Privacy Preserving k means clustering over Vertically Partitioned .. - Vaidya (2003) (2 citations) (Correct)
A Verifiable Secret Shuffle and its Application to E-Voting - Neff (2001) (8 citations) (Correct)
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
Privacy Preserving Regression Modelling via Distributed.. - Sanil, Karr, Reiter, Lin (2004) (Correct)
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
Towards Fault-Tolerant and Secure On-Line Services - Zhou (2001) (3 citations) (Correct)
A Verifiable Secret Sharing Scheme with Statistical.. - Tang, Liu, Wang (2003) (Correct)
(Im)Possibility of Unconditionally Privacy-Preserving Auctions - Brandt, Sandholm (2004) (Correct)
Protecting Secret Keys with Personal Entropy - Ellison, Hall, Milbert, Schneier (1999) (8 citations) (Correct)
Verifiable Mixing (Shuffling) of ElGamal Pairs - Neff (2004) (1 citation) (Correct)
Internet Voting: Concerns and Solutions - Wu, Sankaranarayana (Correct)
A Verifiable Secret Shuffle and its Application to E-Voting - Neff (2001) (8 citations) (Correct)
Fair Cryptosystems - Micali (1993) (3 citations) (Correct)
Protecting Secret Keys with Personal Entropy - Ellison, Hall, Milbert, Schneier (1999) (8 citations) (Correct)
Unconditionally Secure Proactive Secret Sharing Scheme with.. - Stinson, Wei (1999) (1 citation) (Correct)
Secret Sharing with Public Reconstruction - Beimel, Chor (1998) (Correct)
How to Solve any Protocol Problem - An Efficiency Improvement .. - Goldreich, al. (1997) (27 citations) (Correct)
Dense Probabilistic Encryption - Josh Benaloh Clarkson (1994) (22 citations) Self-citation (Benaloh) (Correct)
First 50 documents Next 50
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC