A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Filters
Delegating a Product of Group Exponentiations with Application to Signature Schemes (Submission to Special NutMiC 2019 Issue of JMC)
2020
Journal of Mathematical Cryptology
Preserved Fulltext
multiplications only slightly larger than in the delegation of a single exponentiation. ...
AbstractMany public-key cryptosystems and, more generally, cryptographic protocols, use group exponentiations as important primitive operations. ...
Fixing the first of these two groups for efficiency evaluation, a product of m exponentiations in Zp with σ-bit exponents can be delegated by a client that only uses less than 2λ+m+4 modular multiplications ...
doi:10.1515/jmc-2019-0036
fatcat:zpqb2izhurddnbmtuifnyj5pay
Comparison of innovative signature algorithms for WSNs
2008
Proceedings of the first ACM conference on Wireless network security - WiSec '08
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2008; you can also visit the original URL.
The file type is application/pdf.
To close this gap, we investigated the efficiency and suitability of digital signature algorithms based on innovative asymmetric primitives for WSN. ...
In the literature nearly only RSA and ECC are implemented and compared for sensor nodes, though there exist a variety of innovative asymmetric algorithms. ...
Acknowledgement The work presented in this paper was supported in part by the European Commission within the STREP UbiSec&Sens of the EU Framework Programme 6 for Research and Development (www.ist-ubisecsens.org ...
doi:10.1145/1352533.1352539
dblp:conf/wisec/DriessenPP08
fatcat:lld4squtg5ctzc37midm5y5dny
Efficient Construction of Completely Non-Malleable CCA Secure Public Key Encryption
2016
Proceedings of the 11th ACM on Asia Conference on Computer and Communications Security - ASIA CCS '16
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
Non-malleability is an important and intensively studied security notion for many cryptographic primitives. ...
In our scheme, the well-formed public keys and ciphertexts could be publicly recognized without drawing support from unwieldy techniques like non-interactive zero knowledge proofs or one-time signatures ...
In our construction, the well-formed public keys and ciphertexts could be publicly recognized without drawing support from heavy primitives like non-interactive zero knowledge proofs or one-time signatures ...
doi:10.1145/2897845.2897921
dblp:conf/ccs/SunGLPY16
fatcat:53fw7lkhinaxzjocoq7jttaxoe
Optimal approximate sampling from discrete probability distributions
2019
Proceedings of the ACM on Programming Languages (PACMPL)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2020 pre-print arXiv:2001.04555v1 fatcat:4nwbkezalnbhpnnstihdmbpism
This paper addresses a fundamental problem in random variate generation: given access to a random source that emits a stream of independent fair bits, what is the most accurate and entropy-efficient algorithm ...
(in the sense of entropy consumption). ...
ACKNOWLEDGMENTS This research was supported by a philanthropic gift from the Aphorism Foundation. ...
doi:10.1145/3371104
fatcat:i6id26wdvfh2dik6pcvn3okij4
Efficient multivariate factorization over finite fields
[chapter]
1997
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
We also needed an efficient implementation of our algorithms in Zp[y][x] because any multivariate factorization may depend on several bivariate factorizations. ...
Our first implementation is available in Maple V Release 3. We give selected details of the algorithms and show several ideas that were used to improve its efficiency. ...
To compute in GF(p k) our implementation again makes use of the modpl representation for efficient univariate polynomial arithmetic in
Zp[Z] to implement the field operations in GF(p k) "" Zp[x]/m(x) ...
doi:10.1007/3-540-63163-1_2
fatcat:uwugewy5nraprhouopnomjtbvu
Privacy Preservation for eHealth Big Data in Cloud Accessed Using Resource-Constrained Devices: Survey
2019
International Journal of Network Security
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is application/pdf.
In order to overcome these challenges associated with security and privacy, the data owner (hospital) encrypts data using Attribute Based Encryption (ABE) primitive due to the fine-grained access control ...
Mobile technology is proving to offer unprecedented advantage to health professionals by providing a more efficient transmission and access to health services. ...
ABE computational overhead from exponentiation at user's end side can be relieved by adopting the traditional approach to utilize server-aided techniques [7, 25] . ...
dblp:journals/ijnsec/KibiwottZKOO19
fatcat:m7t27irx6ja4rlkxa7vazvxu5q
Attribute-based signature and its applications
2010
Proceedings of the 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS '10
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
In an attribute-based signature (ABS), users sign messages with any predicate of their attributes issued from an attribute authority. ...
As an illustrative application, we further construct an efficient non-transferable access control system from ABS. * Jin Li is currently with Guangzhou University, China. ...
In the following, we will describe an efficient non-transferable access control systems, obtained from techniques in the previous ABS scheme. ...
doi:10.1145/1755688.1755697
dblp:conf/ccs/LiASXR10
fatcat:4eqp2ti35vbhtfgitjkybkdmr4
On Euclid's algorithm and the computation of polynomial greatest common divisors
1971
Proceedings of the second ACM symposium on Symbolic and algebraic manipulation - SYMSAC '71
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In fact, in the multivariate ease, the maximum computing time for the modular algorithm is strictly dominated by the maximum computing time for the first pseudo-division in the classical algorithm. ...
The recently developed modular algorithm is presented in careful detail, with special attention to the case of multivariate polynomials. ...
in Zp[x] from their images modulo x -bl, • • • , x -bn. ...
doi:10.1145/800204.806288
fatcat:vvk4wmx65zccloqfnh225gxksu
On Euclid's Algorithm and the Computation of Polynomial Greatest Common Divisors
1971
Journal of the ACM
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In fact, in the multivariate ease, the maximum computing time for the modular algorithm is strictly dominated by the maximum computing time for the first pseudo-division in the classical algorithm. ...
The recently developed modular algorithm is presented in careful detail, with special attention to the case of multivariate polynomials. ...
in Zp[x] from their images modulo x -bl, • • • , x -bn. ...
doi:10.1145/321662.321664
fatcat:bgu3j5rnrzgqznegt6vxxskqse
Another advantage of free choice (Extended Abstract)
1983
Proceedings of the second annual ACM symposium on Principles of distributed computing - PODC '83
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2015; you can also visit the original URL.
The file type is application/pdf.
Efficiency The protocols above are not very efficient, and in particular the expected number of rounds to reach agreement may be exponential. ...
In this primitive step process P first performs receive(P). This may be either a message rn from the message buffer that was addressed to P, or the null message ¢. ...
doi:10.1145/800221.806707
dblp:conf/podc/Ben-Or83
fatcat:seqv7p2rinharbljq7v2vgpwlq
Verifiable Internet Elections with Everlasting Privacy and Minimal Trust
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this way, votes are anonymized without the need of trusted authorities. The absence of such authorities reduces the trust assumptions to a minimum and makes our protocol remarkably simple. ...
Ballot Component
Exponentiations in Gp
Exponentiations in Gq Multiplications in Zp π1 From the given results, we conclude again that our protocol works reasonably well for a medium-sized or even a ...
The time estimates are based on 350 exponentiations per second in Gp, 2'000 exponentiations per second in Gq, and 200'000 multiplications per second in Zp. ...
doi:10.1007/978-3-319-22270-7_5
fatcat:cnpv4kk3gnev3khwugbxymufnm
Provably secure ciphertext policy ABE
2007
Proceedings of the 14th ACM conference on Computer and communications security - CCS '07
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The security proof is a reduction to the DBDH assumption and the strong existential unforgeability of the signature primitive. ...
In this paper, we study CP-ABE schemes in which access structures are AND gates on positive and negative attributes. ...
For every i ∈ N , Sim chooses r i at random from Zp and sets ri := r i · b. For every i ∈ M, Sim also chooses w i at random from Zp. For i = j, set wi := w i · b. Set wj := ab + w j · b. ...
doi:10.1145/1315245.1315302
dblp:conf/ccs/CheungN07
fatcat:osxnskteyjhqrmxecn7fc22yyi
Page 4445 of Mathematical Reviews Vol. , Issue 2001G
[page]
2001
Mathematical Reviews
Preserved Fulltext
The Internet Archive has digitized a microfilm copy of this work. It may be possible to borrow a copy for reading.
Cubes and higher powers in products from a block of consecutive integers. 8. Perfect powers in products of integers in arithmetic progressions. ...
The author describes an efficient algorithm for solving index form equations in number fields of degree 9 which are composites of cubic fields with coprime discriminants. ...
Verification of STAR-Vote and Evaluation of FDR and ProVerif
[chapter]
2017
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
in terms of efficiency. ...
In terms of expressiveness, both tools need further research to pursue in automation of cryptographic primitives. ...
doi:10.1007/978-3-319-66845-1_28
fatcat:lp7xdzj2ynfu7i2awklf2pzd3q
Efficient Primitives from Exponentiation in ℤ p
[chapter]
2006
Lecture Notes in Computer Science
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf.
In this work, we investigate the possibility to construct efficient primitives from exponentiation techniques over Zp. ...
Since Diffie-Hellman [14] , many secure systems, based on discrete logarithm or Diffie-Hellman assumption in Zp, were introduced in the literature. ...
In this work, we investigate the possibility to construct efficient and secure primitives from exponentiations in Z * p . ...
doi:10.1007/11780656_22
fatcat:gidv6fuptzbkxaotycnukk6zz4
« Previous
Showing results 1 — 15 out of 1,142 results