ASIACRYPT 2015 - PDF Preprint Papers

ASIACRYPT 2015 International Conference on Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ASIACRYPT-2015 Paper

click to vote

ASIACRYPT
2015
Springer

46views Cryptology» more ASIACRYPT 2015»

Collision Attacks Against CAESAR Candidates - Forgery and Key-Recovery Against AEZ and Marble

8 years 13 days ago

Download eprint.iacr.org

In this paper we study authenticated encryption algorithms inspired by the OCB mode (Oﬀset Codebook). These algorithms use secret oﬀsets (masks derived from a whitening key) to...

Thomas Fuhr, Gaëtan Leurent, Valentin Suder

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	46	Collision Attacks Against CAESAR Candidates - Forgery and Key-Recovery Against AEZ and Marble	claim
2	45	Adaptively Secure Puncturable Pseudorandom Functions in the Standard Model	claim
3	39	Beyond-Birthday-Bound Security for Tweakable Even-Mansour Ciphers with Linear Tweak and Key Mixing	claim
4	37	Heuristic Tool for Linear Cryptanalysis with Applications to CAESAR Candidates	claim
5	35	Generic Security of NMAC and HMAC with Input Whitening	claim
6	33	Counting Keys in Parallel After a Side Channel Attack	claim
7	33	Property Preserving Symmetric Encryption Revisited	claim
8	29	On Black-Box Complexity of Universally Composable Security in the CRS Model	claim
9	28	Analysis of SHA-512/224 and SHA-512/256	claim
10	28	Function-Hiding Inner Product Encryption	claim
11	28	Type 2 Structure-Preserving Signature Schemes Revisited	claim
12	27	Solving Linear Equations Modulo Unknown Divisors: Revisited	claim
13	27	A Framework for Identity-Based Encryption with Almost Tight Security	claim
14	27	On Cut-and-Choose Oblivious Transfer and Its Variants	claim
15	27	Idealizing Identity-Based Encryption	claim
16	26	Compactly Hiding Linear Spans - Tightly Secure Constant-Size Simulation-Sound QA-NIZK Proofs and Applications	claim
17	26	How to Sequentialize Independent Parallel Attacks? - Biased Distributions Have a Phase Transition	claim
18	26	QA-NIZK Arguments in Asymmetric Groups: New Tools and New Constructions	claim
19	25	An Asymptotically Optimal Method for Converting Bit Encryption to Multi-Bit Encryption	claim
20	25	Conversions Among Several Classes of Predicate Encryption and Applications to ABE with Various Compactness Tradeoffs	claim
21	24	Selective Opening Security for Receivers	claim
22	24	An Inverse-Free Single-Keyed Tweakable Enciphering Scheme	claim
23	24	Oblivious Network RAM and Leveraging Parallelism to Achieve Obliviousness	claim
24	23	Dual-System Simulation-Soundness with Applications to UC-PAKE and More	claim
25	23	ASCA, SASCA and DPA with Enumeration: Which One Beats the Other and When?	claim
26	23	New Circular Security Counterexamples from Decision Linear and Learning with Errors	claim
27	23	Security of Full-State Keyed Sponge and Duplex: Applications to Authenticated Encryption	claim
28	21	A Provably Secure Group Signature Scheme from Code-Based Assumptions	claim
29	21	On the Impact of Known-Key Attacks on Hash Functions	claim
30	21	Multi-input Functional Encryption for Unbounded Arity Functions	claim
31	21	Multi-party Key Exchange for Unbounded Parties from Indistinguishability Obfuscation	claim
32	20	Key-Recovery Attacks on ASASA	claim
33	19	Secret Sharing and Statistical Zero Knowledge	claim
34	19	Card-Based Cryptographic Protocols Using a Minimal Number of Cards	claim
35	19	Reverse-Engineering of the Cryptanalytic Attack Used in the Flame Super-Malware	claim
36	19	Multilinear and Aggregate Pseudorandom Functions: New Constructions and Improved Security	claim
37	19	New Realizations of Somewhere Statistically Binding Hashing and Positional Accumulators	claim
38	19	Optimally Secure Block Ciphers from Ideal Primitives	claim
39	18	Limits of Extractability Assumptions with Distributional Auxiliary Input	claim
40	18	Implementing Candidate Graded Encoding Schemes from Ideal Lattices	claim
41	17	Optimized Interpolation Attacks on LowMC	claim
42	15	The Tower Number Field Sieve	claim
43	15	On the Optimality of Non-Linear Computations of Length-Preserving Encryption Schemes	claim
44	14	Midori: A Block Cipher for Low Energy	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers