Linicrypt: A Model for Practical Cryptography

DOI10.1007/978-3-662-53015-3_15zbMath1406.94034OpenAlexW2498996213MaRDI QIDQ2829955

Mike Rosulek, Brent Carmer

Publication date: 9 November 2016

Published in: Advances in Cryptology – CRYPTO 2016 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-53015-3_15

Mathematics Subject Classification ID

Cryptography (94A60)

Related Items (9)

Three halves make a whole? Beating the half-gates lower bound for garbled circuits ⋮ Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems ⋮ Formal analysis of symbolic authenticity ⋮ Moving the bar on computationally sound exclusive-or ⋮ Characterizing collision and second-preimage resistance in Linicrypt ⋮ Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls ⋮ Local XOR unification: definitions, algorithms and application to cryptography ⋮ Secure non-interactive simulation from arbitrary joint distributions ⋮ Unnamed Item

Uses Software

• JustGarble
• FleXOR

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Bit commitment using pseudorandomness
• Fast garbling of circuits under standard assumptions
• Structure-Preserving Signatures from Type II Pairings
• FleXOR: Flexible Garbling for XOR Gates That Beats Free-XOR
• Automated Verification of Block Cipher Modes of Operation, an Improved Method
• On the Instantiability of Hash-and-Sign RSA Signatures
• Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
• SPHINCS: Practical Stateless Hash-Based Signatures
• Two Halves Make a Whole
• Arithmetic Cryptography
• XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
• Improved Garbled Circuit: Free XOR Gates and Applications
• Secure Arithmetic Computation with No Honest Majority
• Merkle Signatures with Virtually Unlimited Signature Capacity
• Secure Two-Party Computation Is Practical
• Automated Security Proof for Symmetric Encryption Modes
• W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
• Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
• Advances in Cryptology - CRYPTO 2003
• CMSS – An Improved Merkle Signature Scheme
• Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
• Selected Areas in Cryptography
• Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
• Cryptography and Coding

This page was built for publication: Linicrypt: A Model for Practical Cryptography