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
Online/Offline Provable Data Possession
2017
IEEE Transactions on Information Forensics and Security
Preserved Fulltext
Technically, we present aggregatable vector Chemeleon hash functions which map a vector of values to a group element and play a central role in the OOPDP transformation. ...
Following the framework, we present two efficient OOPDP instantiations. ...
In this sense, PDP makes data outsourcing more attractive in real-world applications. Publicly verifiable PDP allows any people who holds the system public key to audit the outsourced data. ...
doi:10.1109/tifs.2017.2656461
fatcat:yfbi3kip6begxceqtr5jntki2a
Signature Schemes Secure Against Hard-to-Invert Leakage
2015
Journal of Cryptology
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.
In the auxiliary input model an adversary is allowed to see a computationally hard-to-invert function of the secret key. ...
As a second contribution, we construct a signature scheme that achieves security for random messages assuming that the adversary is given a polynomialtime hard to invert function. ...
The authors thank Yevgeniy Dodis for discussions at an early stage of this project. ...
doi:10.1007/s00145-015-9197-1
fatcat:gv752itwbzdlfamfrc6aigft4i
Signature Schemes Secure against Hard-to-Invert Leakage
[chapter]
2012
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 the auxiliary input model an adversary is allowed to see a computationally hard-to-invert function of the secret key. ...
As a second contribution, we construct a signature scheme that achieves security for random messages assuming that the adversary is given a polynomialtime hard to invert function. ...
The authors thank Yevgeniy Dodis for discussions at an early stage of this project. ...
doi:10.1007/978-3-642-34961-4_8
fatcat:mw2sl5jqmrggte7ixr3dzqr2zu
MPC-Friendly Commitments for Publicly Verifiable Covert Security
[article]
2022
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 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
We introduce the notion of PVC commitment scheme and indexed hash functions to build commitments schemes tailored to the PVC framework, and propose constructions for both arithmetic and Boolean circuits ...
We address the problem of efficiently verifying a commitment in a two-party computation. ...
Both pvccommit and check are efficient in this instantiation, so one would want ℎ to have an efficient MPC protocol. MPC-friendly hashing. The works on fairness certification of Segal et al. ...
arXiv:2109.07461v2
fatcat:l7nvxevuwjaf3bw53kqsdahmpq
Bonsai Trees, or How to Delegate a Lattice Basis
2011
Journal of Cryptology
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.
Applications of bonsai trees include: • An efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and • The first hierarchical identity-based encryption ...
(Statelessness is a crucial property in many real-world scenarios, where distinct systems may sign relative to the same public key.) ...
The ancient art of bonsai is centered around a tree and the selective control thereof by an arborist, the tree's cultivator and caretaker. ...
doi:10.1007/s00145-011-9105-2
fatcat:rvpebkwqpjdjnmxkaamfffulbq
Bonsai Trees, or How to Delegate a Lattice Basis
[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 2015; you can also visit the original URL.
The file type is application/pdf.
Applications of bonsai trees include: • An efficient, stateless 'hash-and-sign' signature scheme in the standard model (i.e., no random oracles), and • The first hierarchical identity-based encryption ...
(Statelessness is a crucial property in many real-world scenarios, where distinct systems may sign relative to the same public key.) ...
The ancient art of bonsai is centered around a tree and the selective control thereof by an arborist, the tree's cultivator and caretaker. ...
doi:10.1007/978-3-642-13190-5_27
fatcat:r6f2xojvhvf6xagod4algivijm
Adaptive-ID Secure Identity-Based Signature Scheme from Lattices in the Standard Model
2017
IEEE Access
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.
By utilizing an admissible hash function with compatible algorithms and lattice trapdoors as basic building blocks, we propose a new IBS scheme over lattices. ...
Moreover, the scheme needs only logarithmic basic matrices as master public key while keeping the same private key size and signature size as those of other standard model latticebased IBS schemes. ...
AN ADMISSIBLE HASH FUNCTION WITH COMPATIBLE ALGORITHMS In [25] , Yamada defined the concept of partitioning function and gave a concrete construction F MAH based on the balanced admissible hash function ...
doi:10.1109/access.2017.2757464
fatcat:f7ueeffjmjf3pcawzci2mnpeli
Dragoon: Private Decentralized HITs Made Practical
[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.
Other Versions
Along the way, we rigorously define the ideal functionality of decentralized HITs and then prove the security due to the ideal-real paradigm. ...
By various non-trivial statement reformations, proving the quality of encrypted data is reduced to efficient verifiable decryption, thus making decentralized HITs practical. ...
ACKNOWLEDGMENT Qiang is supported in part by JD.com and a Google Faculty Award. We would like to thank the anonymous reviewers for their valuable suggestions and comments about this paper. ...
arXiv:2003.10074v3
fatcat:5uq3ya6plngalkbbuhdswkr35y
A Self-certified and Sybil-Free Framework for Secure Digital Identity Domain Buildup
[chapter]
2008
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.
These pseudonyms do not depend on the continuous availability of a TTP and, they are fully unlinkable. ...
of anonymous certificates -however, only one certificate per identity domain and user identity. ...
Acknowledgments This research was funded by the European Network of Excellence Future of Identity in the Information Society (FIDIS) and by the European Integrated Project for Privacy and Identity Management ...
doi:10.1007/978-3-540-79966-5_5
fatcat:k4q4eh772vap7gcj2rlxh73rc4
Rate-limited secure function evaluation
2016
Theoretical 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 2016; you can also visit the original URL.
The file type is application/pdf.
As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first, and instantiate efficient ratelimited variants of it. ...
We introduce the notion of rate-limited secure function evaluation (RL-SFE). ...
We are grateful to Ivan Damgård and to the anonymous reviewers of PKC 2013 for the useful feedback provided on earlier versions of this paper. ...
doi:10.1016/j.tcs.2016.09.020
fatcat:xapggttweze7jae3fq7muxo7ju
Zero-Knowledge Password Policy Checks and Verifier-Based PAKE
[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 2016; you can also visit the original URL.
The file type is application/pdf.
We give general and concrete constructions of ZKPPC protocols and suitable VPAKE protocols for ASCII-based passwords and policies that are commonly used on the web. ...
To this end we introduce a reversible mapping of ASCII characters to integers that can be used to preserve the structure of the password string and a new randomised password hashing scheme for ASCII-based ...
Acknowledgements This research was supported by the German Science Foundation (DFG) through the project PRIMAKE (MA 4957). ...
doi:10.1007/978-3-319-11212-1_17
fatcat:iwrl6tzze5eo7i32jhdciqwapm
Secure Dynamic Big Graph Data: Scalable, Low-Cost Remote Data Integrity Checking
2019
IEEE Access
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 2021; you can also visit the original URL.
The file type is application/pdf.
The proposed scheme is proven secure under a random oracle model. Both the theoretical analysis and the simulation results show that our scheme is practicable for real-world big graphs. ...
We have designed novel ADS based on the graph Voronoi diagram (GVD) and enhanced MHT to address the integrity of graph structure and verifiable sub-graph updates. ...
Both numerical analysis and simulation results showed that our scheme is cost-efficient and scalable for real-world big graphs. ...
doi:10.1109/access.2019.2892442
fatcat:six46jwimnb53dxhparifnr5ne
Rate-Limited Secure Function Evaluation: Definitions and Constructions
[chapter]
2013
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 2015; you can also visit the original URL.
The file type is application/pdf.
As a case study, we take a closer look at the oblivious polynomial evaluation (OPE) protocol of Hazay and Lindell, show that it is commit-first and instantiate efficient rate-limited variants of it. ...
We introduce the notion of rate-limited secure function evaluation (RL-SFE). ...
. , S ) in the ideal world -as discussed in Section 4-that mimics A's output. S initially picks k ← G(1 λ ) andk ← G(1 λ ), runs a copy of A, and keeps an array Σ initially set to be empty. ...
doi:10.1007/978-3-642-36362-7_28
fatcat:j7fnfla2yvedllcox5isnqg3we
The Fiat–Shamir Transformation in a Quantum World
[chapter]
2013
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.
Most schemes are of this type. We then discuss that for some schemes one may be able to resurrect the Fiat-Shamir result in the QROM by modifying the underlying protocol first. ...
We show that there cannot be black-box extractors, as long as the underlying quantum-immune identification scheme is secure against active adversaries and the first message of the prover is independent ...
Tommaso Gagliardoni is supported by the German Federal Ministry of Education and Research (BMBF) within EC-SPRIDE. This work was also supported by CASED (www.cased.de). ...
doi:10.1007/978-3-642-42045-0_4
fatcat:ev7yc3dabneltbnqrcwuuwzg4m
The random oracle model: a twenty-year retrospective
2015
Designs, Codes and Cryptography
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 2016; you can also visit the original URL.
The file type is application/pdf.
In this retrospective we argue that there is no evidence that the need for the random oracle assumption in a proof indicates the presence of a real-world security weakness in the corresponding protocol ...
If one is willing to use the random oracle model (and the analogous generic group model), then various security arguments are known for these two schemes. ...
comments on an earlier draft, and Ann Hibner Koblitz for helpful editorial suggestions. ...
doi:10.1007/s10623-015-0094-2
fatcat:og3kkvd7qnbuxlspbc5lfpay5q
« Previous
Showing results 1 — 15 out of 539 results