1,329 research outputs found
Still Wrong Use of Pairings in Cryptography
Several pairing-based cryptographic protocols are recently proposed with a
wide variety of new novel applications including the ones in emerging
technologies like cloud computing, internet of things (IoT), e-health systems
and wearable technologies. There have been however a wide range of incorrect
use of these primitives. The paper of Galbraith, Paterson, and Smart (2006)
pointed out most of the issues related to the incorrect use of pairing-based
cryptography. However, we noticed that some recently proposed applications
still do not use these primitives correctly. This leads to unrealizable,
insecure or too inefficient designs of pairing-based protocols. We observed
that one reason is not being aware of the recent advancements on solving the
discrete logarithm problems in some groups. The main purpose of this article is
to give an understandable, informative, and the most up-to-date criteria for
the correct use of pairing-based cryptography. We thereby deliberately avoid
most of the technical details and rather give special emphasis on the
importance of the correct use of bilinear maps by realizing secure
cryptographic protocols. We list a collection of some recent papers having
wrong security assumptions or realizability/efficiency issues. Finally, we give
a compact and an up-to-date recipe of the correct use of pairings.Comment: 25 page
An Intrinsic Integrity-Driven Rating Model for a Sustainable Reputation System
In the era of digital markets, the challenge for consumers is discerning
quality amidst information asymmetry. While traditional markets use brand
mechanisms to address this issue, transferring such systems to internet-based
P2P markets, where misleading practices like fake ratings are rampant, remains
challenging. Current internet platforms strive to counter this through
verification algorithms, but these efforts find themselves in a continuous
tug-of-war with counterfeit actions.
Exploiting the transparency, immutability, and traceability of blockchain
technology, this paper introduces a robust reputation voting system grounded in
it. Unlike existing blockchain-based reputation systems, our model harnesses an
intrinsically economically incentivized approach to bolster agent integrity. We
optimize this model to mirror real-world user behavior, preserving the
reputation system's foundational sustainability. Through Monte-Carlo
simulations, using both uniform and power-law distributions enabled by an
innovative inverse transform method, we traverse a broad parameter landscape,
replicating real-world complexity. The findings underscore the promise of a
sustainable, transparent, and formidable reputation mechanism. Given its
structure, our framework can potentially function as a universal, sustainable
oracle for offchain-onchain bridging, aiding entities in perpetually
cultivating their reputation. Future integration with technologies like Ring
Signature and Zero Knowledge Proof could amplify the system's privacy facets,
rendering it particularly influential in the ever-evolving digital domain.Comment: 36 pages,13 figure
Report and Trace Ring Signatures
We introduce report and trace ring signature schemes, balancing the desire for signer anonymity with the ability to report malicious behaviour and subsequently revoke anonymity. We contribute a formal security model for report and trace ring signatures that incorporates established properties of anonymity, unforgeability and traceability, and captures a new notion of reporter anonymity. We present a construction of a report and trace ring signature scheme, proving its security and analysing its efficiency, comparing with the state of the art in the accountable ring signatures literature. Our analysis demonstrates that our report and trace scheme is efficient, particularly for the choice of cryptographic primitives that we use to instantiate our construction. We contextualise our new primitive with respect to related work, and highlight, in particular, that report and trace ring signature schemes protect the identity of the reporter even after tracing is complete
Pairing-based identification schemes
We propose four different identification schemes that make use of bilinear
pairings, and prove their security under certain computational assumptions.
Each of the schemes is more efficient and/or more secure than any known
pairing-based identification scheme
SIGNCRYPTION ANALYZE
The aim of this paper is to provide an overview for the research that has been done so far in signcryption area. The paper also presents the extensions for the signcryption scheme and discusses the security in signcryption. The main contribution to this paper represents the implementation of the signcryption algorithm with the examples provided.ElGamal, elliptic curves, encryption, identity-based, proxy-signcryption, public key, ring-signcryption, RSA, signcryption
- …