Results 1 to 10 of about 2,263 (49)

A Random Card Shuffling Process [PDF]

Involve 17 (2024) 603-632, 2022
Consider a randomly shuffled deck of $2n$ cards with $n$ red cards and $n$ black cards. We study the average number of moves it takes to go from a randomly shuffled deck to a deck that alternates in color by performing the following move: If the top card and the bottom card of the deck differ in color place the top card at the bottom of the deck ...
arxiv   +1 more source

Beware of Pickpockets: A Practical Attack against Blocking Cards [PDF]

The 26th International Symposium on Research in Attacks, Intrusions and Defenses (RAID '23), October 16--18, 2023, Hong Kong, Hong Kong, 2023
Today, we rely on contactless smart cards to perform several critical operations (e.g., payments and accessing buildings). Attacking smart cards can have severe consequences, such as losing money or leaking sensitive information. Although the security protections embedded in smart cards have evolved over the years, those with weak security properties ...
arxiv   +1 more source

OpenPGP Email Forwarding Via Diverted Elliptic Curve Diffie-Hellman Key Exchanges [PDF]

, 2022
An offline OpenPGP user might want to forward part or all of their email messages to third parties. Given that messages are encrypted, this requires transforming them into ciphertexts decryptable by the intended forwarded parties, while maintaining confidentiality and authentication.
arxiv   +1 more source

On Card guessing with two types of cards [PDF]

arXiv, 2023
We consider a card guessing strategy for a stack of cards with two different types of cards, say $m_1$ cards of type red (heart or diamond) and $m_2$ cards of type black (clubs or spades). Given a deck of $M=m_1+m_2$ cards, we propose a refined counting of the number of correct color guesses, when the guesser is provided with complete information, in ...
arxiv  

SoK: Why Johnny Can't Fix PGP Standardization [PDF]

, 2020
Pretty Good Privacy (PGP) has long been the primary IETF standard for encrypting email, but suffers from widespread usability and security problems that have limited its adoption. As time has marched on, the underlying cryptographic protocol has fallen out of date insofar as PGP is unauthenticated on a per message basis and compresses before encryption.
arxiv   +1 more source

Study of Zero-Knowledge protocols and Elliptic Curve Cryptography and their implementation in Smart Card environments using Java Card [PDF]

arXiv, 2023
This paper studies the problem of Zero-Knowledge Protocol (ZKP) and elliptic curve cryptographic implementation in a computationally limited environment, such as, the smart cards, using Java Card. Besides that, it is explained how the zero-knowledge protocol was selected to implement it on a smart card and how the benchmarking was conducted to select ...
arxiv  

Rethinking OpenPGP PKI and OpenPGP Public Keyserver [PDF]

arXiv, 2003
OpenPGP, an IETF Proposed Standard based on PGP application, has its own Public Key Infrastructure (PKI) architecture which is different from the one based on X.509, another standard from ITU. This paper describes the OpenPGP PKI; the historical perspective as well as its current use.
arxiv  

Re: What's Up Johnny? -- Covert Content Attacks on Email End-to-End Encryption [PDF]

arXiv, 2019
We show practical attacks against OpenPGP and S/MIME encryption and digital signatures in the context of email. Instead of targeting the underlying cryptographic primitives, our attacks abuse legitimate features of the MIME standard and HTML, as supported by email clients, to deceive the user regarding the actual message content. We demonstrate how the
arxiv  

On Card guessing games: limit law for no feedback one-time riffle shuffle [PDF]

arXiv, 2023
We consider the following card guessing game with no feedback. An ordered deck of n cards labeled 1 up to n is riffle-shuffled exactly one time. Then, the goal of the game is to maximize the number of correct guesses of the cards. One after another a single card is drawn from the top, the guesser makes a guess without seeing the card and gets no ...
arxiv  

Barrington Plays Cards: The Complexity of Card-based Protocols [PDF]

arXiv, 2020
In this paper we study the computational complexity of functions that have efficient card-based protocols. Card-based protocols were proposed by den Boer [EUROCRYPT '89] as a means for secure two-party computation. Our contribution is two-fold: We classify a large class of protocols with respect to the computational complexity of functions they compute,
arxiv