Linicrypt: a model for practical cryptography
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 4035726 (Why is no real title available?)
- scientific article; zbMATH DE number 697813 (Why is no real title available?)
- scientific article; zbMATH DE number 1024070 (Why is no real title available?)
- scientific article; zbMATH DE number 1942411 (Why is no real title available?)
- scientific article; zbMATH DE number 1942429 (Why is no real title available?)
- scientific article; zbMATH DE number 1950338 (Why is no real title available?)
- scientific article; zbMATH DE number 2086719 (Why is no real title available?)
- scientific article; zbMATH DE number 4185033 (Why is no real title available?)
- Advances in Cryptology - CRYPTO 2003
- Arithmetic cryptography (extended abstract)
- Automated security proof for symmetric encryption modes
- Automated verification of block cipher modes of operation, an improved method
- Bit commitment using pseudorandomness
- CMSS – An Improved Merkle Signature Scheme
- Cryptography and Coding
- Efficient Instantiations of Tweakable Blockciphers and Refinements to Modes OCB and PMAC
- Fast garbling of circuits under standard assumptions
- Flexor: Flexible garbling for XOR gates that beats free-XOR
- Improved Garbled Circuit: Free XOR Gates and Applications
- Merkle Signatures with Virtually Unlimited Signature Capacity
- On the instantiability of hash-and-sign RSA signatures
- Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
- SPHINCS: practical stateless hash-based signatures
- Secure Arithmetic Computation with No Honest Majority
- Secure two-party computation is practical
- Selected Areas in Cryptography
- Strongly-Optimal Structure Preserving Signatures from Type II Pairings: Synthesis and Lower Bounds
- Structure-preserving signatures from type II pairings
- Two halves make a whole: reducing data transfer in garbled circuits using half gates
- Unified, Minimal and Selectively Randomizable Structure-Preserving Signatures
- W-OTS+ – Shorter Signatures for Hash-Based Signature Schemes
- XMSS - A Practical Forward Secure Signature Scheme Based on Minimal Security Assumptions
Cited in
(10)- Secure non-interactive simulation from arbitrary joint distributions
- Algorithmic problems in the symbolic approach to the verification of automatically synthesized cryptosystems
- Formal analysis of symbolic authenticity
- Three halves make a whole? Beating the half-gates lower bound for garbled circuits
- Characterizing collision and second-preimage resistance in Linicrypt
- Moving the bar on computationally sound exclusive-or
- Impossibility of indifferentiable iterated blockciphers from 3 or less primitive calls
- Symbolic encryption with pseudorandom keys
- CryptoSolve: towards a tool for the symbolic analysis of cryptographic algorithms
- Local XOR unification: definitions, algorithms and application to cryptography
This page was built for publication: Linicrypt: a model for practical cryptography
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829955)
