yusuke1997/dblp-id-title huggingface dataset:
Ratcheted Encryption and Key Exchange: The Security of Messaging
A High-Speed DES Implementation for Network Applications
Stronger Security for Reusable Garbled Circuits, General Definitions and Attacks
Learning with Rounding, Revisited - New Reduction, Properties and Applications
Practical Functional Encryption for Quadratic Functions with Applications to Predicate Encryption
Securing Computation against Continuous Leakage
Privacy Amplification Secure Against Active Adversaries
Always Have a Backup Plan: Fully Secure Synchronous MPC with Asynchronous Fallback
Zero-Knowledge Simulation of Boolean Circuits
MPC in the Head Using the Subfield Bilinear Collision Problem
Sequential Traitor Tracing
Cryptanalysis of 2R - Schemes
Key Rotation for Authenticated Encryption
Highly Nonlinear Resilient Functions Optimizing Siegenthaler's Inequality
Improved Delegation of Computation Using Fully Homomorphic Encryption
The Application of Smart Cards for RSA Digital Signatures in a Network Comprising both Interactive and Store-and-Foreward Facilities
Key Distribution Protocol for Digital Mobile Communication Systems
Encrypt or Decrypt? To Make a Single-Key Beyond Birthday Secure Nonce-Based MAC
Generic Side-Channel Distinguishers: Improvements and Limitations
Secure Signatures and Chosen Ciphertext Security in a Quantum Computing World
One-Way Functions and the Hardness of (Probabilistic) Time-Bounded Kolmogorov Complexity w.r.t. Samplable Distributions
Anonymous Communication and Anonymous Cash
An Update on Factorization at Sandia National Laboratories (Abstract)
Correlated Pseudorandomness from the Hardness of Quasi-Abelian Decoding
New Preimage Attacks against Reduced SHA-1
On the Linear Span of binary Sequences Obtained from Finite Geometries
Towards a Unified Approach to Black-Box Constructions of Zero-Knowledge Proofs
The First Experimental Cryptanalysis of the Data Encryption Standard
(Nondeterministic) Hardness vs. Non-malleability
RSA-Based Undeniable Signatures
A Low Communication Competitive Interactive Proof System for Promised Quadratic Residuosity
Proofs of Partial Knowledge and Simplified Design of Witness Hiding Protocols
A Secure and Privacy-protecting Protocol for Transmitting Personal Information Between Organizations
Structural Evaluation of AES and Chosen-Key Distinguisher of 9-Round AES-128
A New Public-Key Cryptosystem via Mersenne Numbers
The Complexity of Computing Hard Core Predicates
Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
An Abstract Theory of Computer Viruses
Aperiodic Linear Complexities of de Bruijn Sequences
Explicit Non-malleable Codes Against Bit-Wise Tampering and Permutations
Compressed Pairings
Forward-Secure Signatures with Optimal Signing and Verifying
Public-Key Identification Schemes Based on Multivariate Quadratic Polynomials
Unconditionally Secure Commitments with Quantum Auxiliary Inputs
Non-Uniform Bounds in the Random-Permutation, Ideal-Cipher, and Generic-Group Models
sfDualMS: Efficient Lattice-Based Two-Round Multi-signature with Trapdoor-Free Simulation
New Results on Pseudorandom Permutation Generators Based on the DES Scheme
On Signatures of Knowledge
Fully-Succinct Multi-key Homomorphic Signatures from Standard Assumptions
A Quasi-polynomial Time Algorithm for the Extrapolated Dihedral Coset Problem over Power-of-Two Moduli
Two-Round Stateless Deterministic Two-Party Schnorr Signatures from Pseudorandom Correlation Functions
Non-Uniformly Sound Certificates with Applications to Concurrent Zero-Knowledge
How to Record Quantum Queries, and Applications to Quantum Indifferentiability
Security Analysis of NIST CTR-DRBG
RSA-OAEP Is Secure under the RSA Assumption
On the Generic Insecurity of the Full Domain Hash
Secure Computation (Abstract)
Homomorphic Encryption from Learning with Errors: Conceptually-Simpler, Asymptotically-Faster, Attribute-Based
A Study of Password Security
DES '81: An Update
NIZK Amplification via Leakage-Resilient Secure Computation
Some Remarks on Lucas-Based Cryptosystems
Scrambling and Randomization
On the Security of Ping-Pong Protocols when Implemented using the RSA
Tor and Circumvention: Lessons Learned - (Abstract to Go with Invited Talk)
Lower Bound on SNARGs in the Random Oracle Model
Provably Secure Reflection Ciphers
GGH15 Beyond Permutation Branching Programs: Proofs, Attacks, and Candidates
Threshold Cryptosystems from Threshold Fully Homomorphic Encryption
Provably Secure Partially Blind Signatures
Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part I
Implementing an Electronic Notary Public
A Message Authenticator Algorithm Suitable for A Mainframe Computer
Adaptively Secure Garbled Circuits from One-Way Functions
Indistinguishability Obfuscation from Trilinear Maps and Block-Wise Local PRGs
Invariant Signatures and Non-Interactive Zero-Knowledge Proofs are Equivalent (Extended Abstract)
A Simple and Secure Way to Show the Validity of Your Public Key
Succinct Arguments for sfBatchsfQMA and Friends Under 8 Rounds
Electronic Funds Transfer Point of Sale in Australia
LPN Decoded
Exploiting Parallelism in Hardware Implementations of the DES
The Mix-and-Cut Shuffle: Small-Domain Encryption Secure against N Queries
Robust Distributed Multiplicaton with out Interaction
Is ML-Based Cryptanalysis Inherently Limited? Simulating Cryptographic Adversaries via Gradient-Based Methods
Feistel-Like Structures Revisited: Classification and Cryptanalysis
The Exact Multi-User Security of Key-Alternating Feistel Ciphers with a Single Permutation
SpOT-Light: Lightweight Private Set Intersection from Sparse OT Extension
Supersingular Abelian Varieties in Cryptology
Circuit ABE with sfpoly( depth,λ )-Sized Ciphertexts and Keys from Lattices
Algebraic Attacks on Combiners with Memory
Cryptanalysis of the Lifted Unbalanced Oil Vinegar Signature Scheme
Universally Composable Incoercibility
SoftSpokenOT: Quieter OT Extension from Small-Field Silent VOLE in the Minicrypt Model
Secret Sharing and Perfect Zero Knowledge
Multi-Language Zero Knowledge Interactive Proof Systems
Multiparty Generation of an RSA Modulus
Zeroizing Without Low-Level Zeroes: New MMAP Attacks and their Limitations
Diffie-Hellman Oracles
Insuperability of the Standard Versus Ideal Model Gap for Tweakable Blockcipher Security
A One-Round, Two-Prover, Zero-Knowledge Protocol for NP
BaseFold: Efficient Field-Agnostic Polynomial Commitment Schemes from Foldable Codes
New Design Techniques for Efficient Arithmetization-Oriented Hash Functions: ttAnemoi Permutations and ttJive Compression Mode
How to Model Unitary Oracles
Graph-Theoretic Algorithms for the Alternating Trilinear Form Equivalence Problem
Efficient Multiplication on Certain Nonsupersingular Elliptic Curves
On the Bounded Sum-of-Digits Discrete Logarithm Problem in Finite Fields
A Practical-Time Related-Key Attack on the KASUMI Cryptosystem Used in GSM and 3G Telephony
Timed Commitments
Improved Lattice Blind Signatures from Recycled Entropy
On Perfect Linear Approximations and Differentials over Two-Round SPNs
Non-full Sbox Linearization: Applications to Collision Attacks on Round-Reduced Keccak
Nonlinear Vector Resilient Functions
Cycle Structures of the DES with Weak and Semi-Weak Keys
The Algebraic FreeLunch: Efficient Gröbner Basis Attacks Against Arithmetization-Oriented Primitives
Leakage-Tolerant Computation with Input-Independent Preprocessing
Scalable Secure Multiparty Computation
Security of Ramp Schemes
Sometimes You Can't Distribute Random-Oracle-Based Proofs
Asymptotic Complexities of Discrete Logarithm Algorithms in Pairing-Relevant Finite Fields
Snarky Signatures: Minimal Signatures of Knowledge from Simulation-Extractable SNARKs
UMAC: Fast and Secure Message Authentication
The Number Field Sieve in the Medium Prime Case
Lower Bounds on Lattice Enumeration with Extreme Pruning
Taming the Adversary
The use of Encryption in Kerberos for Network Authentication
On the Risk of Opening Distributed Keys
ZMAC: A Fast Tweakable Block Cipher Mode for Highly Secure Message Authentication
Large-Scale Secure Computation: Multi-party Computation for (Parallel) RAM Programs
A Zero-Knowledge Poker Protocol That Achieves Confidentiality of the Players' Strategy or How to Achieve an Electronic Poker Face
Advances in Cryptology - CRYPTO 2003, 23rd Annual International Cryptology Conference, Santa Barbara, California, USA, August 17-21, 2003, Proceedings
Exclusive Ownership of Fiat-Shamir Signatures: ML-DSA, SQIsign, LESS, and More
Quantum Non-malleability and Authentication
Pseudorandom Quantum States
Modular Exponentiation Using Recursive Sums of Residues
Tweakable Blockciphers with Beyond Birthday-Bound Security
Promise Zero Knowledge and Its Applications to Round Optimal MPC
Related-Key Security for Pseudorandom Functions Beyond the Linear Barrier
On the Discrepancy between Serial and Parallel of Zero-Knowledge Protocols (Extended Abstract)
Fully Anonymous Secret Sharing
On Tightly Secure Non-Interactive Key Exchange
A Key Escrow System with Warrant Bounds
On Families of Hash Functions via Geometric Codes and Concatenation
On the Impossibility of Private Key Cryptography with Weakly Random Keys
Malicious Security for SCALES - Outsourced Computation with Ephemeral Servers
1/ p -Secure Multiparty Computation without Honest Majority and the Best of Both Worlds
Proofs of Space
Structure-Aware Private Set Intersection, with Applications to Fuzzy Matching
Structural Properties of One-way Hash Functions
On the Security of Keyed Hashing Based on Public Permutations
CBC MACs for Arbitrary-Length Messages: The Three-Key Constructions
Speeding up Elliptic Cryptosystems by Using a Signed Binary Window Method
Receipt-Free Universally-Verifiable Voting with Everlasting Privacy
Is There an ultimate Use of Cryptography?
Perfect Zero-Knowledge Arguments for NP Can Be Based on General Complexity Assumptions (Extended Abstract)
Tight Tradeoffs in Searchable Symmetric Encryption
Non-interactive Non-malleability from Quantum Supremacy
A Parallel Permutation Multiplier for a PGM Crypto-chip
How Many Oblivious Transfers Are Needed for Secure Multiparty Computation?
Equivalence of Uniform Key Agreement and Composition Insecurity
Beyond the Csiszár-Korner Bound: Best-Possible Wiretap Coding via Obfuscation
MHz2k: MPC from HE over $\mathbb {Z}_{2^k}$ with New Packing, Simpler Reshare, and Better ZKP
On Central Primitives for Quantum Cryptography with Classical Communication
Resistance against Iterated Attacks by Decorrelation Revisited,
Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part III
The Noisy Oracle Problem
A General Public Key System
Merkle-Damgård Revisited: How to Construct a Hash Function
Variant of a Public Key Cryptosystem Based on Goppa Codes
Maliciously Circuit-Private FHE
Probabilistic Termination and Composability of Cryptographic Protocols
Geometric Shared Secret and/or Shared Control Schemes
On the Foundations of Modern Cryptography
Fast Hashing on the Pentium
Robust and Efficient Sharing of RSA Functions
New Techniques for Traitor Tracing: Size N 1/3 and More from Pairings
An Efficient Discrete Log Pseudo Random Generator
Full Domain Hash from (Leveled) Multilinear Maps and Identity-Based Aggregate Signatures
Revisiting the Constant-Sum Winternitz One-Time Signature with Applications to SPHINCS + and XMSS
Reducing the Number of Qubits in Quantum Factoring
That's AmorE: Amortized Efficiency for Pairing Delegation
Collision-Resistant Hashing: Towards Making UOWHFs Practical
MPC with Friends and Foes
Utility Dependence in Correct and Fair Rational Secret Sharing
Cryptographic Capsules: A Disjunctive Primative for Interactive Protocols
Two-Round Multiparty Secure Computation Minimizing Public Key Operations
Amplifying Collision Resistance: A Complexity-Theoretic Treatment
LatticeFold+: Faster, Simpler, Shorter Lattice-Based Folding for Succinct Proof Systems
Fast RSA-Type Cryptosystem Modulo p k q
Non-Public Key Distribution
Practical Schnorr Threshold Signatures Without the Algebraic Group Model
Succinct Arguments from Multi-prover Interactive Proofs and Their Efficiency Benefits
Online Ciphers and the Hash-CBC Construction
Many-to-One Trapdoor Functions and Their Ralation to Public-Key Cryptosystems
Cryptanalysis of the Oil & Vinegar Signature Scheme
Converting Cryptographic Schemes from Symmetric to Asymmetric Bilinear Groups
Fast Server-Aided RSA Signatures Secure Against Active Attacks
Randomizable Proofs and Delegatable Anonymous Credentials
Collusion-Free Multiparty Computation in the Mediated Model
On the Shortness of Vectors to Be Found by the Ideal-SVP Quantum Algorithm
T-Spoon: Tightly Secure Two-Round Multi-signatures with Key Aggregation
How to Make Any Computational Secret Sharing Scheme Adaptively Secure
The Dark Side of "Black-Box" Cryptography, or: Should We Trust Capstone?
Demonstrating That a Public Predicate Can Be Satisfied Without Revealing Any Information About How
New Results on Visual Cryptography
An Efficient and Parallel Gaussian Sampler for Lattices
Asymptotically Good Ideal Linear Secret Sharing with Strong Multiplication over Any Fixed Finite Field
On the Efficiency of Classical and Quantum Oblivious Transfer Reductions
Schnorr Signatures are Tightly Secure in the ROM Under a Non-interactive Assumption
Broadcast Encryption with Size N 1/3 and More from k-Lin
Degree Evaluation of NFSR-Based Cryptosystems
Information Theory Without the Finiteness Assumption, II: Unfolding the DES
Improved Reductions from Noisy to Bounded and Probing Leakages via Hockey-Stick Divergences
Quantum Collision Attacks on Reduced SHA-256 and SHA-512
Cryptanalysis of the Immunized LL Public Key Systems
A Secure Poker Protocol that Minimizes the Effect of Player Coalitions
Pricing via Processing or Combatting Junk Mail
Three Halves Make a Whole? Beating the Half-Gates Lower Bound for Garbled Circuits
The Prisoners' Problem and the Subliminal Channel
Ofelimos: Combinatorial Optimization via Proof-of-Useful-Work - A Provably Secure Blockchain Protocol
Accuracy-Privacy Tradeoffs for Two-Party Differentially Private Protocols
On the Feasibility of Unclonable Encryption, and More
Private Circuits: Securing Hardware against Probing Attacks
Improved Resultant Attack Against Arithmetization-Oriented Primitives
New Constructions of Hinting PRGs, OWFs with Encryption, and More
Leakage-Resilient Public-Key Cryptography in the Bounded-Retrieval Model
Optimal Verification of Operations on Dynamic Sets
Multi-identity and Multi-key Leveled FHE from Learning with Errors
Simple Tests of Quantumness Also Certify Qubits
Improved Attacks for SNOVA by Exploiting Stability Under a Group Action
Lower Bounds for Garbled Circuits from Shannon-Type Information Inequalities
Communication Lower Bounds for Statistically Secure MPC, With or Without Preprocessing
Adaptive Security for Threshold Cryptosystems
On the Power of Cascade Ciphers
Analyzing Blockwise Lattice Algorithms Using Dynamical Systems
Broadcast-Optimal Two Round MPC with an Honest Majority
From Selective to Adaptive Security in Functional Encryption
Security-Preserving Distributed Samplers: How to Generate Any CRS in One Round Without Random Oracles
Fast Distributed RSA Key Generation for Semi-honest and Malicious Adversaries
Publicly-Verifiable Deletion via Target-Collapsing Functions
Perfect Hiding and Perfect Binding Universally Composable Commitment Schemes with Constant Expansion Factor
Statistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
Public-Key Cryptosystems from Lattice Reduction Problems
Unique Signatures and Verifiable Random Functions from the DH-DDH Separation
Impossibility of Quantum Virtual Black-Box Obfuscation of Classical Circuits
Advances in Cryptology: A Report on CRYPTO 81, CRYPTO 81, IEEE Workshop on Communications Security, Santa Barbara, California, USA, August 24-26, 1981
A Framework for Statistically Sender Private OT with Optimal Rate
Collusion Resistant Watermarkable PRFs from Standard Assumptions
Optimal Structure-Preserving Signatures in Asymmetric Bilinear Groups
Implicit Zero-Knowledge Arguments and Applications to the Malicious Setting
To Label, or Not To Label (in Generic Groups)
Order-Preserving Encryption Revisited: Improved Security Analysis and Alternative Solutions
Oblivious RAM with Worst-Case Logarithmic Overhead
How to Use (Plain) Witness Encryption: Registered ABE, Flexible Broadcast, and More
How to Protect DES Against Exhaustive Key Search
On-Line/Off-Line Digital Schemes
Programmable Hash Functions Go Private: Constructions and Applications to (Homomorphic) Signatures with Shorter Public Keys
The Impact of Decryption Failures on the Security of NTRU Encryption
Some Public Key Crypto-Functions as Intractable as Factorization
On the Security Properties of OAEP as an All-or-Nothing Transform
New Results on the φ-Hiding Assumption and Factoring Related RSA Moduli
Constructive Post-Quantum Reductions
Threshold Traitor Tracing
Session-Key Generation Using Human Passwords Only
Memory-Tight Reductions
CDS Composition of Multi-round Protocols
Counter-in-Tweak: Authenticated Encryption Modes for Tweakable Block Ciphers
Constructing Locally Leakage-Resilient Linear Secret-Sharing Schemes
Kid Krypto
Noninteractive Statistical Zero-Knowledge Proofs for Lattice Problems
Attack on the Koyama-Ohta Identity Basedd Key Distribution Scheme
Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Computing Discrete Logarithms
A New Approach to Practical Active-Secure Two-Party Computation
Integral Cryptanalysis on Full MISTY1
Eliminating Decryption Errors in the Ajtai-Dwork Cryptosystem
Collusion Resistant Broadcast Encryption with Short Ciphertexts and Private Keys
Extensions of Single-term Coins
The t-wise Independence of Substitution-Permutation Networks
A Key Distribution "Paradox"
Registered ABE and Adaptively-Secure Broadcast Encryption from Succinct LWE
One-Way Functions Imply Secure Computation in a Quantum World
The MALICIOUS Framework: Embedding Backdoors into Tweakable Block Ciphers
Security of the Fiat-Shamir Transformation in the Quantum Random-Oracle Model
The Summation-Truncation Hybrid: Reusing Discarded Bits for Free
The Use of Public-Key Cryptography for Signing Checks
Efficient Hybrid Exact/Relaxed Lattice Proofs and Applications to Rounding and VRFs
That's Not My Signature! Fail-Stop Signatures for a Post-quantum World
Bare PAKE: Universally Composable Key Exchange from Just Passwords
Advances in Cryptology - CRYPTO '90, 10th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1990, Proceedings
Entity Authentication and Key Distribution
An Optimally Secure Relativized Cryptosystem
Private-Key Algebraic-Coded Cryptosystems
Functional Graph Revisited: Updates on (Second) Preimage Attacks on Hash Combiners
Somewhat Non-committing Encryption and Efficient Adaptively Secure Oblivious Transfer
Security Proof for Partial-Domain Hash Signature Schemes
A Signature with Shared Verification Scheme
Untraceable Electronic Cash
Adaptively Secure Three-Round Threshold Schnorr Signatures from DDH
Formalizing Delayed Adaptive Corruptions and the Security of Flooding Networks
A Simple Protocol for Signing Contracts
On the Power of Power Analysis in the Real World: A Complete Break of the KeeLoqCode Hopping Scheme
Non-interactive Universal Arguments
Architectures for Exponentiation in GF(2 n )
Pubic Randomness in Cryptography
Time-Optimal Interactive Proofs for Circuit Evaluation
An Information Theoretic Analysis of Rooted-Tree Based Secure Multicast Key Distribution Schemes
Protecting Cryptographic Keys against Continual Leakage
Fully Secure MPC and zk-FLIOP over Rings: New Constructions, Improvements and Extensions
Secure Computation on the Web: Computing without Simultaneous Interaction
Threshold DSS Signatures without a Trusted Party
Efficiently-Thresholdizable Batched Identity Based Encryption, with Applications
Leakage-Resilient Key Exchange and Two-Seed Extractors
Practical Round-Optimal Blind Signatures in the Standard Model
Indistinguishability Obfuscation Without Multilinear Maps: New Paradigms via Low Degree Weak Pseudorandomness and Security Amplification
Signature Schemes and Anonymous Credentials from Bilinear Maps
Designated-Verifier SNARGs with One Group Element
Necessary and Sufficient Conditions For Collision-Free Hashing
Time-Space Tradeoffs for Sponge Hashing: Attacks and Limitations for Short Collisions
Merkle Mountain Ranges are Optimal: On Witness Update Frequency for Cryptographic Accumulators
A Comprehensive Evaluation of Mutual Information Analysis Using a Fair Evaluation Framework
Verifiable Delay Functions
On the Design of S-Boxes
Algorithms in HElib
The Strict Avalanche Criterion: Spectral Properties of Boolean Functions and an Extended Definition
On the Higher Order Nonlinearities of Algebraic Immune Functions
A Simpler Variant of Universally Composable Security for Standard Multiparty Computation
Improving the Security of Exponential Key Exchange
Feistel Schemes and Bi-linear Cryptanalysis
Deniable Fully Homomorphic Encryption from Learning with Errors
Asymmetric Message Franking: Content Moderation for Metadata-Private End-to-End Encryption
Fast Message Franking: From Invisible Salamanders to Encryptment
Arc: Accumulation for Reed-Solomon Codes
An Algebraic Framework for Silent Preprocessing with Trustless Setup and Active Security
Language Dependent Secure Bit Commitment
Lattice-Based Zero-Knowledge Proofs and Applications: Shorter, Simpler, and More General
Infinite Structures in Information Theory
Robust Additive Randomized Encodings from IO and Pseudo-Non-linear Codes
Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks
Cryptography with Constant Input Locality
Constant-Round Asynchronous MPC with Optimal Resilience and Linear Communication
Advances in Cryptology - CRYPTO 2012 - 32nd Annual Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2012. Proceedings
Crowhammer: Full Key Recovery Attack on Falcon with a Single Rowhammer Bit Flip
Efficient Identification and Signatures for Smart Cards
Fast Practical Lattice Reduction Through Iterated Compression
Hardness of Non-interactive Differential Privacy from One-Way Functions
Leader Election with Poly-Logarithmic Communication Per Party
Plaintext-Ciphertext Matrix Multiplication and FHE Bootstrapping: Fast and Fused
A More Complete Analysis of the Signal Double Ratchet Algorithm
Delegation with Updatable Unambiguous Proofs and PPAD-Hardness
Two-Round Threshold Signature from Algebraic One-More Learning with Errors
Advances in Cryptology - CRYPTO '91, 11th Annual International Cryptology Conference, Santa Barbara, California, USA, August 11-15, 1991, Proceedings
Cryptanalysis of the Co-ACD Assumption
Almost Tight Multi-user Security Under Adaptive Corruptions from LWE in the Standard Model
Advances in Cryptology - CRYPTO 2018 - 38th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 19-23, 2018, Proceedings, Part II
Efficient Pseudorandom Functions via On-the-Fly Adaptation
Pairing-Free Blind Signatures from CDH Assumptions
An Improved Linear Syndrome Algorithm in Cryptanalysis With Applications
Efficient Collision Search Attacks on SHA-0
Advances in Cryptology - CRYPTO '85, Santa Barbara, California, USA, August 18-22, 1985, Proceedings
An Efficient CDH-Based Signature Scheme with a Tight Security Reduction
KLPT 2 : Algebraic Pathfinding in Dimension Two and Applications
Cryptanalysis of the FLIP Family of Stream Ciphers
Zero Knowledge Proofs of Knowledge in Two Rounds
Almost Independent and Weakly Biased Arrays: Efficient Constructions and Cryptologic Applications
Tweakable Permutation-Based Luby-Rackoff Constructions
The TinyTable Protocol for 2-Party Secure Computation, or: Gate-Scrambling Revisited
Proving Resistance Against Invariant Attacks: How to Choose the Round Constants
On Fair Exchange, Fair Coins and Fair Sampling
Efficient Dissection of Composite Problems, with Applications to Cryptanalysis, Knapsacks, and Combinatorial Search Problems
Diffie-Hellman is as Strong as Discrete Log for Certain Primes
Attacks on Some RSA Signatures