IACR 2011 - PDF Preprint Papers

IACR 2011

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed IACR-2011 Paper

click to vote

IACR
2011

292views more IACR 2011»

Practical Relay Attack on Contactless Transactions by Using NFC Mobile Phones

13 years 2 days ago

Download eprint.iacr.org

—Contactless technology is widely used in security sensitive applications, including identiﬁcation, payment and access-control systems. Near Field Communication (NFC) is a shor...

Lishoy Francis, Gerhard P. Hancke, Keith Mayes, Ko...

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	292	Practical Relay Attack on Contactless Transactions by Using NFC Mobile Phones	claim
2	255	A Standard-Model Security Analysis of TLS-DHE	claim
3	252	A Meet-in-the-Middle Attack on the Full KASUMI	claim
4	243	Guess-then-Meet-in-the-Middle Attacks on the KTANTAN Family of Block Ciphers	claim
5	223	Supplemental Access Control (PACE v2): Security Analysis of PACE Integrated Mapping	claim
6	221	A Novel RFID Distance Bounding Protocol Based on Physically Unclonable Functions	claim
7	212	Fully Homomorphic Encryption without Bootstrapping	claim
8	209	Improved Attacks on Full GOST	claim
9	207	Cryptanalysis and Security Enhancement of an Advanced Authentication Scheme using Smart Cards, and a Key Agreement Scheme for Two-Party Communication	claim
10	206	Shortest Lattice Vectors in the Presence of Gaps	claim
11	205	Biclique Cryptanalysis of the Block Cipher SQUARE	claim
12	196	Multiparty Computation with Low Communication, Computation and Interaction via Threshold FHE	claim
13	192	The Hummingbird-2 Lightweight Authenticated Encryption Algorithm	claim
14	182	Cryptanalysis of AZUMI: an EPC Class-1 Generation-2 Standard Compliant RFID Authentication Protocol	claim
15	177	New attacks on Keccak-224 and Keccak-256	claim
16	173	All-But-Many Lossy Trapdoor Functions	claim
17	166	Bicliques for Preimages: Attacks on Skein-512 and the SHA-2 family	claim
18	162	The Parazoa Family: Generalizing the Sponge Hash Functions	claim
19	161	Roots of Square: Cryptanalysis of Double-Layer Square and Square+	claim
20	158	Can Homomorphic Encryption be Practical?	claim
21	156	Fortification of AES with Dynamic Mix-Column Transformation	claim
22	155	Terminating BKZ	claim
23	152	Rational distance-bounding protocols over noisy channels	claim
24	152	Progression-Free Sets and Sublinear Pairing-Based Non-Interactive Zero-Knowledge Arguments	claim
25	151	Cryptanalysis with Ternary Difference: Applied to Block Cipher PRESENT	claim
26	149	Improved zero-sum distinguisher for full round Keccak-f permutation	claim
27	149	Public Key Encryption for the Forgetful	claim
28	147	Adaptive Security of Concurrent Non-Malleable Zero-Knowledge	claim
29	146	Identity-based Digital Signature Scheme Without Bilinear Pairings	claim
30	142	XMSS - A Practical Forward Secure Signature Scheme based on Minimal Security Assumptions	claim
31	141	Approximate common divisors via lattices	claim
32	139	Improved Meet-in-the-Middle Cryptanalysis of KTANTAN	claim
33	139	SGCM: The Sophie Germain Counter Mode	claim
34	137	Lightweight Anonymous Authentication with TLS and DAA for Embedded Mobile Devices	claim
35	137	Distance Hijacking Attacks on Distance Bounding Protocols	claim
36	136	Trapdoors for Lattices: Simpler, Tighter, Faster, Smaller	claim
37	135	Charm: A framework for Rapidly Prototyping Cryptosystems	claim
38	135	Algebraic Complexity Reduction and Cryptanalysis of GOST	claim
39	135	An Improved Internet Voting Protocol	claim
40	135	Fully Homomorphic Encryption without Squashing Using Depth-3 Arithmetic Circuits	claim
41	134	An Exploration of the Kolmogorov-Smirnov Test as Competitor to Mutual Information Analysis	claim
42	134	Efficient Implementation of Grand Cru with TI C6x+ Processor	claim
43	134	Concise Vector Commitments and their Applications to Zero-Knowledge Elementary Databases	claim
44	133	Compact McEliece keys based on Quasi-Dyadic Srivastava codes	claim
45	133	Attractive Subfamilies of BLS Curves for Implementing High-Security Pairings	claim
46	132	Homomorphic encryption from codes	claim
47	132	Tamper-Proof Circuits: How to Trade Leakage for Tamper-Resilience	claim
48	131	Direct Exponent and Scalar Multiplication Classes of an MDS Matrix	claim
49	130	Hiding the Policy in Cryptographic Access Control	claim
50	129	Bounded Vector Signatures and their Applications	claim
51	129	Improved Side Channel Cube Attacks on PRESENT	claim
52	128	Fault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher	claim
53	128	Sign Modules in Secure Arithmetic Circuits	claim
54	128	Identity-Based Cryptography for Cloud Security	claim
55	127	Corrigendum to: The Cube Attack on Stream Cipher Trivium and Quadraticity Tests	claim
56	127	Near-Linear Unconditionally-Secure Multiparty Computation with a Dishonest Minority	claim
57	127	Cryptanalysis of KeeLoq code-hopping using a Single FPGA	claim
58	127	Oblivious RAM with O((log N)^3) Worst-Case Cost	claim
59	126	On Enumeration of Polynomial Equivalence Classes and Their Application to MPKC	claim
60	125	On Constructing Homomorphic Encryption Schemes from Coding Theory	claim
61	124	Efficient Multicast Key Distribution Using HOWF-based Access Control Structures	claim
62	124	Zero-Correlation Linear Cryptanalysis of Block Ciphers	claim
63	124	Generic Fully Simulatable Adaptive Oblivious Transfer	claim
64	124	Group Law Computations on Jacobians of Hyperelliptic Curves	claim
65	124	Using the Cloud to Determine Key Strengths	claim
66	123	Hummingbird: Privacy at the time of Twitter	claim
67	122	On Authenticated Encryption Using Stream Ciphers Supporting an Initialisation Vector	claim
68	121	Two RFID Privacy Models in Front of a Court	claim
69	120	McOE: A Foolproof On-Line Authenticated Encryption Scheme	claim
70	120	Towards quantum-resistant cryptosystems from supersingular elliptic curve isogenies	claim
71	116	Fully Homomorphic Encryption, Approximate Lattice Problem and LWE	claim
72	116	Some Words About Cryptographic Key Recognition In Data Streams	claim
73	115	Multi-Server Oblivious RAM	claim
74	115	Pseudorandom Functions and Lattices	claim
75	115	Threshold Encryption into Multiple Ciphertexts	claim
76	114	Faster Scalar Multiplication on Ordinary Weierstrass Elliptic Curves over Fields of Characteristic Three	claim
77	113	Fully Homomorphic SIMD Operations	claim
78	113	Implementing 4-Dimensional GLV Method on GLS Elliptic Curves with j-Invariant 0	claim
79	113	GNUC: A New Universal Composability Framework	claim
80	113	Fastplay-A Parallelization Model and Implementation of SMC on CUDA based GPU Cluster Architecture	claim
81	113	KISS: A Bit Too Simple	claim
82	112	A Domain Transformation for Structure-Preserving Signatures on Group Elements	claim
83	112	Improved Generic Algorithms for Hard Knapsacks	claim
84	111	Secure Multi-Party Sorting and Applications	claim
85	110	On the (In)security of Hash-based Oblivious RAM and a New Balancing Scheme	claim
86	110	Decoding One Out of Many	claim
87	108	On lower bounds on second-order nonliearities of bent functions obtained by using Niho power functions	claim
88	107	Structure Preserving CCA Secure Encryption and Its Application to Oblivious Third Parties	claim
89	107	Identity-Based (Lossy) Trapdoor Functions and Applications	claim
90	106	Hash Functions Based on Three Permutations: A Generic Security Analysis	claim
91	106	Unaligned Rebound Attack - Application to Keccak	claim
92	105	Leakage Tolerant Interactive Protocols	claim
93	104	Linear Cryptanalysis of PRINTcipher - Trails and Samples Everywhere	claim
94	104	Secure Multi-Party Computation of Boolean Circuits with Applications to Privacy in On-Line Marketplaces	claim
95	104	Collusion Resistant Obfuscation and Functional Re-encryption	claim
96	104	Short Transitive Signatures for Directed Trees	claim
97	101	Policy-Enhanced Private Set Intersection: Sharing Information While Enforcing Privacy Policies	claim
98	98	New Receipt-Free E-Voting Scheme and Self-Proving Mix Net as New Paradigm	claim
99	97	Two-Output Secure Computation with Malicious Adversaries	claim
100	97	A constant-round resettably-sound resettable zero-knowledge argument in the BPK model	claim
101	94	Practical Key-recovery For All Possible Parameters of SFLASH	claim
102	94	After-the-Fact Leakage in Public-Key Encryption	claim
103	94	Secure Computation with Sublinear Amortized Work	claim
104	92	From Non-Adaptive to Adaptive Pseudorandom Functions	claim
105	91	Improved Generalized Birthday Attack	claim
106	91	A Scalable Method for Constructing Galois NLFSRs with Period $2^n-1$ using Cross-Join Pairs	claim
107	90	On the Security of the Winternitz One-Time Signature Scheme	claim
108	90	Group-oriented ring signature	claim
109	90	Four-Dimensional Gallant-Lambert-Vanstone Scalar Multiplication	claim
110	89	Concurrently Secure Computation in Constant Rounds	claim
111	89	Threshold Fully Homomorphic Encryption and Secure Computation	claim
112	89	Identity-Based Decryption	claim
113	88	Storing Secrets on Continually Leaky Devices	claim
114	88	Targeted Malleability: Homomorphic Encryption for Restricted Computations	claim
115	88	GCM, GHASH and Weak Keys	claim
116	87	Untangling RFID Privacy Models	claim
117	87	Is privacy compatible with truthfulness?	claim
118	86	Protecting Drive Encryption Systems Against Memory Attacks	claim
119	85	Random Number Generation Based on Oscillatory Metastability in Ring Circuits	claim
120	85	Some Instant- and Practical-Time Related-Key Attacks on KTANTAN32/48/64	claim
121	84	Tools for Simulating Features of Composite Order Bilinear Groups in the Prime Order Setting	claim
122	83	Outsourcing Multi-Party Computation	claim
123	82	Wild McEliece Incognito	claim
124	82	Collision for 75-step SHA-1: Intensive Parallelization with GPU	claim
125	81	From Extractable Collision Resistance to Succinct Non-Interactive Arguments of Knowledge, and Back Again	claim
126	80	History-Free Sequential Aggregate Signatures	claim
127	75	Graceful Degradation in Multi-Party Computation	claim
128	74	A Parallel Repetition Theorem for Leakage Resilience	claim
129	73	Secure Authentication from a Weak Key, Without Leaking Information	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers