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.
Filters
Revisiting Cryptographic Accumulators, Additional Properties and Relations to Other Primitives
[chapter]
2015
Lecture Notes in Computer Science
Preserved Fulltext
To this end, we propose a unified formal model for (randomized) cryptographic accumulators which covers static and dynamic accumulators, their universal features and includes the notions of undeniability ...
Cryptographic accumulators allow to accumulate a finite set of values into a single succinct accumulator. ...
The reason for this is that the accumulation of the additional random value immediately breaks the binding property. ...
doi:10.1007/978-3-319-16715-2_7
fatcat:ilvfycrawfakfp3t476wu3eusi
Bivariate Polynomials Modulo Composites and Their Applications
[chapter]
2014
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.
We explore the assumption and relate it to known computational problems. ...
The assumption leads to (i) a new statistically hiding commitment scheme that composes well with Pedersen commitments, (ii) a conceptually simple cryptographic accumulator, and (iii) an efficient chameleon ...
We are grateful to Bjorn Poonen for information about injective polynomials, to Steven Galbraith and Antoine Joux for comments on our cryptographic assumptions, and to Don Zagier for recounting his rationale ...
doi:10.1007/978-3-662-45611-8_3
fatcat:3rim4gol2jcqdlzkbbw5t24cjq
A Guideline on Pseudorandom Number Generation (PRNG) in the IoT
[article]
2020
arXiv
pre-print
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:2007.11839v1 fatcat:kxelt6op2nc6bbfo6qe7a7hc2eOther Versions
recommendations on how to build such a random subsystem and which generators to use. ...
In this paper, we revisit the generation of randomness from the perspective of an IoT operating system (OS) that needs to support general purpose or crypto-secure random numbers. ...
His particular research interest includes low-power radios, and IoT protocols, many of which he analyzed and transformed into code of RIOT. ...
arXiv:2007.11839v2
fatcat:dkiqyrddgfbfngxo2ysca3rb6a
Generalizations and Extensions of Redactable Signatures with Applications to Electronic Healthcare
[chapter]
2010
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 2018; you can also visit the original URL.
The file type is application/pdf.
Furthermore, we present extensions to our scheme, adding features not commonly provided by other redactable signature schemes. ...
Additionally, various applications in healthcare are discussed, supporting the applicability and usability of our construction. ...
A's output as his own) and can break one of the used cryptographic primitives with non-negligible advantage. ...
doi:10.1007/978-3-642-13241-4_19
fatcat:knjrcuyxzra6vpajybtc5bge3u
Towards Authenticity and Privacy Preserving Accountable Workflows
[chapter]
2016
IFIP Advances in Information and Communication Technology
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.
Related Work Besides [40, 39, 34] , not much attention has been paid to cryptographically enforcing certain properties of workflows. ...
Subsequently, we review the existing approaches and other related concepts. ...
doi:10.1007/978-3-319-41763-9_12
fatcat:52wvnoo7ajhk3b3bncmjzmutjq
Symmetric Cryptography (Dagstuhl Seminar 18021)
2018
Dagstuhl Reports
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 2022; you can also visit the original URL.
The file type is application/pdf.
This report documents the program and the outcomes of Dagstuhl Seminar 18021 "Symmetric ...
I wish to thank Eli Biham for discussions related to conditional linear cryptanalysis and Céline Blondeau for suggestions how to improve the presentation. ...
We discussed how to instantiate the Whitened Swap-Or-Not Construction by S. Tessaro [1]. ...
doi:10.4230/dagrep.8.1.1
dblp:journals/dagstuhl-reports/DaemenILN18
fatcat:qffcmfhvu5bappymycvy5pbxvy
Physical Security in the Post-quantum Era: A Survey on Side-channel Analysis, Random Number Generators, and Physically Unclonable Functions
[article]
2021
arXiv
pre-print
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:2005.04344v1 fatcat:zqxxrg6qczfprixfar6inxbbce
Physical security deals with the design and implementation of security measures fulfilling the practical requirements of cryptographic primitives, which are equally essential for classic and quantum ones ...
Besides, proposals for quantum random number generation and quantum physically unclonable functions are compared to their classic counterparts and further analyzed to give a better understanding of their ...
In addition to running a randomness extraction algorithm, this step can be taken to buffer and accumulate samples before outputting the random strings and/or to test whether the generator is working properly ...
arXiv:2005.04344v2
fatcat:jstlhwebznfadf5g2zdri4sb6i
Taking Authenticated Range Queries to Arbitrary Dimensions
2014
Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security - CCS '14
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.
We study the problem of authenticated multi-dimensional range queries over outsourced databases, where an owner outsources its database to an untrusted server, which maintains it and answers queries to ...
In this paper, we propose the first schemes that (i) scale linearly with the number of dimensions, and (ii) support queries on any set of dimensions with linear in the number of attributes setup cost and ...
Acknowledgments We thank all the anonymous reviewers for their detailed comments and suggestions. Research supported in part by NSF grants CNS-1012798 and CNS-1012910. ...
doi:10.1145/2660267.2660373
dblp:conf/ccs/PapadopoulosPT14
fatcat:k6fhlkupcnazzo37fydm5ryvie
An Alternative Paradigm for Developing and Pricing Storage on Smart Contract Platforms
[article]
2019
arXiv
pre-print
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.
Second, we propose a scheme where the cost of storage-related operations reflects the effort that miners have to expend to execute them. ...
This issue, if left unchecked, may lead to centralization and directly impact Ethereum's security and longevity. ...
To address this, we revisit Ethereum's storage cost model and propose modifications that: 1) price storage-related operations based on the effort that miners have to expend to execute them, 2) ensure that ...
arXiv:1902.00881v1
fatcat:olifzut4mrcjlkhvoeoyfe4xya
The Cryptographic Abstract Machine
[chapter]
2004
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.
Here we define the CrAM and show how slightly refurbished message patterns of [RRS03] can be compiled to CrAM code both for analysis and for creation of messages, and prove the correctness and completeness ...
This is motivated both by a theoretical purpose of relating the dynamics of protocol executions at different levels of abstraction, and by a practical purpose of enabling automatic generation of provably ...
The PrimitiveValue types are understood to consist of booleans, bytes and other primitive values needed. ...
doi:10.1007/978-3-540-24773-9_15
fatcat:bxzew6vd4jd7dbebkebrqabpoq
Anonymous Certification for an e-Assessment Framework
[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 2018; you can also visit the original URL.
The file type is application/pdf.
Attribute-based signature schemes are considered as a promising cryptographic primitive for building privacy-preserving attribute credentials, also known as anonymous credentials. ...
These mechanisms allow the derivation of certified attributes by the issuing authority relying on noninteractive protocols and enable end-users to authenticate with verifiers in a pseudonymous manner, ...
The authors graciously acknowledge as well the support received from the Chair Values and Policies of Personal Information of the Institut Mines-Télécom. ...
doi:10.1007/978-3-319-70290-2_5
fatcat:wxczjaqzkrf6xjdebrpmcqi6tq
Public Key Cryptography in Sensor Networks—Revisited
[chapter]
2005
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 2012; you can also visit the original URL.
The file type is application/pdf.
In order to validate our claim we present proof of concept implementations of two different algorithms-Rabin's Scheme and NtruEncrypt-and analyze their architecture and performance according to various ...
It is therefore common practice to emulate the asymmetry of traditional public key based cryptographic services through a set of protocols [1] using symmetric key based message authentication codes (MACs ...
Further research into energy efficient cryptographic primitives is necessary, but our findings give us the confidence that public key cryptography in ubiquitous computing applications is possible and that ...
doi:10.1007/978-3-540-30496-8_2
fatcat:uhke7a4ng5bgfixn2pohezikia
Authenticating Aggregate Queries over Set-Valued Data with Confidentiality
2018
IEEE Transactions on Knowledge and Data Engineering
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.
Prior to this, he has held academic positions in HKUST and HKBU since he received his PhD degree from HKUST in 2005. ...
As many aggregate queries are composed of multiset operations such as set union and subset, we first develop a family of privacy-preserving authentication protocols for primitive multiset operations. ...
This distinguishes the accumulator function from other cryptographic hash functions such as SHA-1. ...
doi:10.1109/tkde.2017.2773541
fatcat:tgiibrupkrfz5kia7iekrgxram
Tempering Kademlia with a Robust Identity Based System
2008
2008 Eighth International Conference on Peer-to-Peer Computing
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 main purpose of this paper is to present Likir (Layered Identity-based Kademlia-like In-fRastructure), a framework that includes an identity based scheme and a secure communication protocol, built ...
This will be accomplished with the adoption of a certification service, with the use of an authentication protocol between nodes and with the introduction of credentials to make non-repudiable the ownership ...
Acknowledgments This work has been partially supported by the Italian Ministry for University and Research (MIUR), within the framework of the "PROFILES" project (PRIN). ...
doi:10.1109/p2p.2008.40
dblp:conf/p2p/AielloMRS08
fatcat:qu34zswwn5db7inbmho4whqb2e
Unrolled Cryptography on Silicon
2020
Transactions on Cryptographic Hardware and Embedded Systems
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.
On another note, it has been indicated that unrolled primitives without any additional means of protection offer an intrinsic resistance to SCA attacks due to their parallelism, asynchronicity and speed ...
Cryptographic primitives with low-latency performance have gained momentum lately due to an increased demand for real-time applications. ...
Acknowledgments The author would like to thank the TCHES 2020 reviewers for their constructive feedback and Amir Moradi for his input and support. ...
doi:10.46586/tches.v2020.i4.416-442
fatcat:d44ffosapbbsvlw5yfza5hl6uu
« Previous
Showing results 1 — 15 out of 428 results