Showing papers on "Secret sharing published in 1987"

Verifiable secret-ballot elections

Abstract: Privacy in secret-ballot elections has traditionally been attained by using a ballot box or voting booth to disassociate voters from ballots. Although such a system might achieve privacy, there is often little confidence in the accuracy of the announced tally. This thesis describes a practical scheme for conducting secret-ballot elections in which the outcome of an election is verifiable by all participants and even by non-participating observers. All communications are public, yet under a suitable number-theoretic assumption, the privacy of votes remains intact. The tools developed here to conduct such elections have additional independent applications. Cryptographic capsules allow a prover to convince verifiers that either statement A or statement B is true without revealing substantial information as to which. Secret sharing homomorphisms enable computation on shared (secret) data and give a method of distributing shares of a secret such that each shareholder can verify the validity of all shares.

Secret sharing homomorphisms: keeping shares of a secret secret

Abstract: In 1979, Blackley and Shamir independently proposed schemes by which a secret can be divided into many shares which can be distributed to mutually suspicious agents. This paper describes a homomorphism property attained by these and several other secret sharing schemes which allows multiple secrets to be combined by direct computation on shares. This property reduces the need for trust among agents and allows secret sharing to be applied to many new problems. One application described here gives a method of verifiable secret sharing which is much simpler and more efficient than previous schemes. A second application is described which gives a fault-tolerant method of holding verifiable secret-ballot elections.

Advances in cryptology -- CRYPTO '86 : proceedings

Abstract: Data Encryption Standard.- Structure in the S-Boxes of the DES (extended abstract).- Cycle Structure of the DES with Weak and Semi-Weak Keys.- Public-Key Cryptography.- Private-Key Algebraic-Coded Cryptosystems.- Some Variations on RSA Signatures & their Security.- Breaking the Cade Cipher.- A Modification of a Broken Public-Key Cipher.- A Pseudo-Random Bit Generator Based on Elliptic Logarithms.- Two Remarks Concerning the Goldwasser-Micali-Rivest Signature Scheme.- Public-key Systems Based on the Difficulty of Tampering (Is there a difference between DES and RSA?).- A Secure and Privacy-Protecting Protocol for Transmitting Personal Information Between Organizations.- Cryptographic Protocols And Zero-Knowledge Proofs.- How to Prove All NP Statements in Zero-Knowledge and a Methodology of Cryptographic Protocol Design (Extended Abstract).- How To Prove Yourself: Practical Solutions to Identification and Signature Problems.- Demonstrating that a Public Predicate can be Satisfied Without Revealing Any Information About How.- Demonstrating Possession of a Discrete Logarithm Without Revealing it.- Cryptographic Capsules: A Disjunctive Primitive for Interactive Protocols.- Zero-Knowledge Simulation of Boolean Circuits.- All-or-Nothing Disclosure of Secrets.- A zero-knowledge Poker protocol that achieves confidentiality of the players' strategy or How to achieve an electronic Poker face.- Secret-Sharing Methods.- Secret Sharing Homomorphisms: Keeping Shares of a Secret Secret (Extended Abstract).- How to Share a Secret with Cheaters.- Smallest Possible Message Expansion in Threshold Schemes.- Hardware Systems.- VLSI implementation of public-key encryption algorithms.- Architectures for exponentiation in GF(2n).- Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor.- Software Systems.- A High Speed Manipulation Detection Code.- Electronic Funds Transfer Point of Sale in Australia.- Software Protection, Probabilistic Methods, and Other Topics.- The Notion of Security for Probabilistic Cryptosystems (Extended Abstract).- Large-Scale Randomization Techniques.- On the Linear Span of Binary Sequences Obtained from Finite Geometries.- Some Constructions and Bounds for Authentication Codes.- Towards a Theory of Software Protection (Extended Abstract).- Informal Contributions.- Two Observations on Probabilistic Primality Testing.- Public Key Registration.- Is there an ultimate use of cryptography? (Extended Abstract).- Smart Card a Highly Reliable and Portable Security Device.- Thomas - A Complete Single Chip RSA Device.