位置：成果数据库 > 会议 > 会议详情页
On relationship of computational diffie-hellman problem and computational square-root exponent probl
  • 所属机构名称：中山大学
  • 会议名称：3rd International Workshop on Coding and Cryptology, IWCC 2011
  • 时间：2011
  • 成果类型：会议
  • 相关项目：不经意传输的理论与新应用研究
作者： Zhang, Fangguo|Wang, Ping|
同会议论文项目
不经意传输的理论与新应用研究
期刊论文 32 会议论文 16 专利 3
同项目会议论文
Secure Similarity Coefficients Computation with Malicious Adversaries
Efficient and Secure Batch Exponentiations Outsourcing in Cloud Computing
Zero-Value Point Attacks on Kummer-Based Cryptosystem
Finding More Boolean Functions with Maximum Algebraic Immunity Based on Univariate Polynomial Repres
Secure Obfuscation of Conditional Re - encryption with Keyword Search
On Obfuscating Set - Membership Predicate Functions
Traitor Tracing against Public Collaboration
Selective Opening Chosen Ciphertext Security Directly from the DDH Assumption
On the resistance of Boolean functions against fast algebraic attacks
Verifiable evaluation of private polynomials
Improving the Parallelized Pollard Rho Method for Computing Elliptic Curve Discrete Logarithms
Two Applications of an Incomplete Additive Character Sum to Estimating Non linearity of Boolean Func
A New Revocable Secret Handshake Scheme with Backward Unlinkability
Secure Obfuscation of Encrypted Verifiable Encrypted Signatures
Oblivious Transfer with Complex Attribute-Based Access Control