• Publications
  • Influence
A Practical Public Key Cryptosystem Provably Secure Against Adaptive Chosen Ciphertext Attack
A new public key cryptosystem is proposed and analyzed that is provably secure against adaptive chosen ciphertext attack under standard intractability assumptions. Expand
  • 1,438
  • 133
  • PDF
Universal Hash Proofs and a Paradigm for Adaptive Chosen Ciphertext Secure Public-Key Encryption
We present several new and fairly practical public-key encryption schemes and prove them secure against adaptive chosen ciphertext attack. Expand
  • 740
  • 124
  • PDF
Design and Analysis of Practical Public-Key Encryption Schemes Secure against Adaptive Chosen Ciphertext Attack
A new public-key encryption scheme, along with several variants, is proposed and analyzed. Expand
  • 903
  • 116
  • PDF
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
We use a proof of knowledge P, an access structure Γ, and a secret sharing scheme S for the access structure dual to Γ to build a new protocol, in which the prover shows that he knows some subset of n secrets. Expand
  • 1,116
  • 78
  • PDF
Detection of Algebraic Manipulation with Applications to Robust Secret Sharing and Fuzzy Extractors
We introduce a new primitive called an algebraic manipulation detection (AMD) code, which encodes a source s into a value x stored on Σ(G) so that any tampering by an adversary will be detected. Expand
  • 241
  • 41
  • PDF
Secure Multiparty Computation and Secret Sharing
In a data-driven society, individuals and companies encounter numerous situations where private information is an important resource. Expand
  • 248
  • 38
  • PDF
General Secure Multi-party Computation from any Linear Secret-Sharing Scheme
We show that verifiable secret sharing (VSS) and secure multi-party computation among a set of n players can efficiently be based on any linear secret sharing scheme (LSSS) for the players, provided that the access structure of the LSSS allows MPC or VSS at all. Expand
  • 455
  • 34
A Secure and Optimally Efficient Multi-Authority Election Scheme
We present a new multi-authority secret-ballot election scheme that guarantees privacy, universal verifiability, and robustness. Expand
  • 586
  • 33
  • PDF
Multiparty Computation from Threshold Homomorphic Encryption
We introduce a new approach to multiparty computation (MPC) basing it on homomorphic threshold crypto-systems. We show that given keys for any sufficiently efficient system of this type, general MPCExpand
  • 218
  • 23