Efficient Protocols based on Probabilistic Encryption using Composite Degree Residue Classes
暂无分享,去创建一个
[1] Peter D. Mosses,et al. Logical Specification of Operational Semantics , 1999, CSL.
[2] Christian N. S. Pedersen,et al. Pseudoknots in RNA secondary structures , 2000, RECOMB '00.
[3] Victor Shoup,et al. Practical Threshold Signatures , 2000, EUROCRYPT.
[4] Ivan Damgård,et al. Efficient Multiparty Computations Secure Against an Adaptive Adversary , 1999, EUROCRYPT.
[5] Jacques Stern,et al. Sharing Decryption in the Context of Voting or Lotteries , 2000, Financial Cryptography.
[6] Igor Walukiewicz. Local Logics for Traces , 2002, J. Autom. Lang. Comb..
[7] Wang Yi,et al. On Memory-Block Traversal Problems in Model-Checking Timed-Systems , 2000, TACAS.
[8] Rasmus Pagh. A New Trade-Off for Deterministic Dictionaries , 2000, SWAT.
[9] Pascal Paillier,et al. Public-Key Cryptosystems Based on Composite Degree Residuosity Classes , 1999, EUROCRYPT.
[10] Ronald Cramer,et al. A secure and optimally efficient multi-authority election scheme , 1997, Eur. Trans. Telecommun..
[11] Anna Philippou,et al. Tools and Algorithms for the Construction and Analysis of Systems , 2018, Lecture Notes in Computer Science.
[12] Peter D. Mosses. A Modular SOS for Action Notation , 1999 .
[13] Kazue Sako,et al. Efficient Receipt-Free Voting Based on Homomorphic Encryption , 2000, EUROCRYPT.
[14] Peter D. Mosses. A Modular SOS for ML Concurrency Primitives , 1999 .
[15] Jean-Jacques Quisquater,et al. A Practical Zero-Knowledge Protocol Fitted to Security Microprocessor Minimizing Both Transmission and Memory , 1988, EUROCRYPT.