yusuke1997/dblp-id-title huggingface dataset:
Near-Collisions of SHA-0
Identity-based Conference Key Distribution Systems
Simon's Algorithm and Symmetric Crypto: Generalizations and Automatized Applications
Complete Classification of Bilinear Hard-Core Functions
Relations Among Notions of Security for Public-Key Encryption Schemes
The Security of All-or-Nothing Encryption: Protecting against Exhaustive Key Search
Indistinguishability Amplification
Unconditionally Secure Quantum Commitments with Preprocessing
Universally Composable Efficient Multiparty Computation from Threshold Homomorphic Encryption
Stacked Garbling - Garbled Circuit Proportional to Longest Execution Path
Plug and Play Encryption
Subvector Commitments with Application to Succinct Arguments
Cryptanalysis Based on 2-Adic Rational Approximation
Key Reconstruction
Analyzing Encryption Protocols Using Formal Verification Authentication Schemes
Dynamic Bounded-Collusion Streaming Functional Encryption from Minimal Assumptions
Low Communication Complexity Protocols, Collision Resistant Hash Functions and Secret Key-Agreement Protocols
Another Birthday Attack
Coded-BKW: Solving LWE Using Lattice Codes
New Proofs for NMAC and HMAC: Security without collision-resistance
Efficient Methods for Integrating Traceability and Broadcast Encryption
Towards Bidirectional Ratcheted Key Exchange
How to Build Pseudorandom Functions from Public Random Permutations
Pushing the Limits of Valiant's Universal Circuits: Simpler, Tighter and More Compact
The Filter-Combiner Model for Memoryless Synchronous Stream Ciphers
Exploring Constructions of Compact NIZKs from Various Assumptions
Proactive RSA
(Almost) Optimal Constructions of UOWHFs from 1-to-1, Regular One-Way Functions and Beyond
A Fourier Transform Approach to the Linear Complexity of Nonlinearly Filtered Sequences
Fiat-Shamir for Repeated Squaring with Applications to PPAD-Hardness and VDFs
Radical $\root N \of {\mathrm {\acute{e}lu}}$ Isogeny Formulae
Dependence of Output on Input in DES: Small Avalanche Characteristics
Random Oracle Combiners: Breaking the Concatenation Barrier for Collision-Resistance
Proactive Secret Sharing Or: How to Cope With Perpetual Leakage
Privacy-Preserving Datamining on Vertically Partitioned Databases
Efficient Hardware and Software Implementations for the DES
Reusable Online-Efficient Commitments
A New Framework for More Efficient Round-Optimal Lattice-Based (Partially) Blind Signature via Trapdoor Sampling
New Ideas for Factoring Large Integers
On the Power of the Randomized Iterate
Password-Authenticated Key Exchange from Group Actions
Lattice-Based SNARKs: Publicly Verifiable, Preprocessing, and Recursively Composable - (Extended Abstract)
Public-Key Anamorphism in (CCA-Secure) Public-Key Encryption and Beyond
NFS with Four Large Primes: An Explosive Experiment
On the Existence of Bit Commitment Schemes and Zero-Knowledge Proofs
On the Impossibility of Constructing Efficient Key Encapsulation and Programmable Hash Functions in Prime Order Groups
A Self-Synchronizing Cascaded Cipher System With Dynamic Control of Error-Propagation
Advances in Cryptology - CRYPTO 2017 - 37th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 20-24, 2017, Proceedings, Part III
On the Necessity of Exhaustive Search for System-Invariant Cryptanalysis
On 2-Round Secure Multiparty Computation
Compressing Proofs of k-Out-Of-n Partial Knowledge
Tighter Security for Schnorr Identification and Signatures: A High-Moment Forking Lemma for ${\varSigma }$-Protocols
LaBRADOR: Compact Proofs for R1CS from Module-SIS
Tight Bounds for Unconditional Authentication Protocols in the Manual Channel and Shared Key Models
Beyond Uniformity: Better Security/Efficiency Tradeoffs for Compression Functions
Trapdoor Rings and Their Use in Cryptography
The Power of Undirected Rewindings for Adaptive Security
IPAKE: Isomorphisms for Password-Based Authenticated Key Exchange
Does the Dual-Sieve Attack on Learning with Errors Even Work?
Semantic Security for the Wiretap Channel
Concurrent Secure Computation with Optimal Query Complexity
Round-Optimal Black-Box Commit-and-Prove with Succinct Communication
LWE with Quantum Amplitudes: Algorithm, Hardness, and Oblivious Sampling
CAPA: The Spirit of Beaver Against Physical Attacks
Universally Composable SNARKs with Transparent Setup without Programmable Random Oracle
New Bound on Authentication Code with Arbitration
Secure Hybrid Encryption from Weakened Key Encapsulation
The XTR Public Key System
The Security of Multiple Encryption in the Ideal Cipher Model
Computational Indistinguishability Amplification: Tight Product Theorems for System Composition
Brakedown: Linear-Time and Field-Agnostic SNARKs for R1CS
CHIP and CRISP: Protecting All Parties Against Compromise Through Identity-Binding PAKEs
Securing Approximate Homomorphic Encryption Using Differential Privacy
A Classification of Computational Assumptions in the Algebraic Group Model
Round-Optimal, Fully Secure Distributed Key Generation
Cryptosystems Based on an Analog of Heat Flow
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part III
Functional Encryption for Regular Languages
Private Set Intersection in the Internet Setting from Lightweight Oblivious PRF
A Preliminary Report on the Cryptanalysis of Merkle-Hellman Knapsack Cryptosystems
Proofs of Work From Worst-Case Assumptions
Improving Implementable Meet-in-the-Middle Attacks by Orders of Magnitude
Updates on Generic Attacks against HMAC and NMAC
Multi-theorem Designated-Verifier NIZK for QMA
Signed Binary Representations Revisited
Online Authenticated-Encryption and its Nonce-Reuse Misuse-Resistance
Handling Adaptive Compromise for Practical Encryption Schemes
FuLeakage: Breaking FuLeeca by Learning Attacks
Black-Box Parallel Garbled RAM
Interactive Hashing can Simplify Zero-Knowledge Protocol Design Without Computational Assumptions (Extended Abstract)
Long-Lived Broadcast Encryption
What Information Is Leaked under Concurrent Composition?
A Note on Adaptive Security in Hierarchical Identity-Based Encryption
Efficient Multiparty Protocols Using Circuit Randomization
Information-Theoretic Indistinguishability via the Chi-Squared Method
A Crypto-Engine
Efficient Three-Party Computation from Cut-and-Choose
Recent Advances and Existing Research Questions in Platform Security
Function-Private Identity-Based Encryption: Hiding the Function in Functional Encryption
Speeding Up Preimage and Key-Recovery Attacks with Highly Biased Differential-Linear Approximations
Fork-Resilient Continuous Group Key Agreement
Simple and General Counterexamples for Private-Coin Evasive LWE
Systematic Design of Two-Party Authentication Protocols
Advances in Cryptology - CRYPTO 2014 - 34th Annual Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2014, Proceedings, Part I
Breaking the Cade Cipher
Links Among Impossible Differential, Integral and Zero Correlation Linear Cryptanalysis
Guaranteed Output Delivery Comes Free in Honest Majority MPC
Differential Privacy with Imperfect Randomness
The Use of Interaction in Public Cryptosystems (Extended Abstract)
Fully Homomorphic Encryption without Modulus Switching from Classical GapSVP
On Cycles of Pairing-Friendly Abelian Varieties
Cryptanalysis of the Chor-Rivest Cryptosystem
Secure Multiparty Computation with Minimal Interaction
Flaws in Applying Proof Methodologies to Signature Schemes
Developing Ethernet Enhanced-Security System
QFESTA: Efficient Algorithms and Parameters for FESTA Using Quaternion Algebras
Massively Parallel Computation of Discrete Logarithms
On One-Shot Signatures, Quantum vs. Classical Binding, and Obfuscating Permutations
An Update on Quantum Cryptography
Encrypting Problem Instances: Or ..., Can You Take Advantage of Someone Without Having to Trust Him?
Design of Combiners to Prevent Divide and Conquer Attacks
Advances in Cryptology - CRYPTO 2021 - 41st Annual International Cryptology Conference, CRYPTO 2021, Virtual Event, August 16-20, 2021, Proceedings, Part IV
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part II
Greyhound: Fast Polynomial Commitments from Lattices
Round-Optimal Composable Blind Signatures in the Common Reference String Model
A Method for Making Password-Based Key Exchange Resilient to Server Compromise
Non-malleable Codes for Bounded Parallel-Time Tampering
On the Indifferentiability of Key-Alternating Ciphers
Credential Authenticated Identification and Key Exchange
A Unified Framework for Succinct Garbling from Homomorphic Secret Sharing
Authenticated Garbling from Simple Correlations
Differential Meet-In-The-Middle Cryptanalysis
Quantum Indistinguishability of Random Sponges
Improved Online/Offline Signature Schemes
A Switching Closure Test to Analyze Cryptosystems
Translating Between the Common Haar Random State Model and the Unitary Model
Advances in Cryptology - CRYPTO 2020 - 40th Annual International Cryptology Conference, CRYPTO 2020, Santa Barbara, CA, USA, August 17-21, 2020, Proceedings, Part I
The Distinction Between Fixed and Random Generators in Group-Based Assumptions
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part IV
Comparing the Difficulty of Factorization and Discrete Logarithm: A 240-Digit Experiment
Weak Keys for IDEA
Realizing Chosen Ciphertext Security Generically in Attribute-Based Encryption and Predicate Encryption
Time- and Space-Efficient Arguments from Groups of Unknown Order
New Birthday Attacks on Some MACs Based on Block Ciphers
On Sequential Functions and Fine-Grained Cryptography
Layout Graphs, Random Walks and the t-Wise Independence of SPN Block Ciphers
Smallest Possible Message Expansion in Threshold Schemes
Memory-Hard Functions from Cryptographic Primitives
Fully Adaptive Schnorr Threshold Signatures
National Security and Commercial Security: Division of Responsibility
Identity-Based Encryption from Codes with Rank Metric
Algorithms for Black-Box Fields and their Application to Cryptography (Extended Abstract)
A Perfect Zero-Knowledge Proof for a Problem Equivalent to Discrete Logarithm
Zero-Knowledge Proofs on Secret-Shared Data via Fully Linear PCPs
Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor
Fast Correlation Attacks over Extension Fields, Large-Unit Linear Approximation and Cryptanalysis of SNOW 2.0
The Solution of McCurley's Discrete Log Challenge
New and Improved Key-Homomorphic Pseudorandom Functions
Fast RSA-Type Cryptosystems Using N-Adic Expansion
Quantum State Group Actions
Quantum One-Time Programs - (Extended Abstract)
Factorization Using the Quadratic Sieve Algorithm
Efficient Generation of Shared RSA Keys (Extended Abstract)
Advances in Cryptology - CRYPTO 2024 - 44th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 18-22, 2024, Proceedings, Part II
Plain versus Randomized Cascading-Based Key-Length Extension for Block Ciphers
Substitution-Permutation Networks, Pseudorandom Functions, and Natural Proofs
Halo Infinite: Proof-Carrying Data from Additive Polynomial Commitments
A Modular Approach to Unclonable Cryptography
Construction of Differential Characteristics in ARX Designs Application to Skein
Weak Key Authenticity and the Computational Completeness of Formal Encryption
Domain Extension of Public Random Functions: Beyond the Birthday Barrier
Unconditional Authenticity and Privacy from an Arbitrarily Weak Secret
Some Cryptographic Aspects of Womcodes
STIR: Reed-Solomon Proximity Testing with Fewer Queries
Indistinguishability Obfuscation from Compact Functional Encryption
A Detailed Analysis of Fiat-Shamir with Aborts
Orion: Zero Knowledge Proof with Linear Prover Time
Advancing Scalability in Decentralized Storage: A Novel Approach to Proof-of-Replication via Polynomial Evaluation
One-Way Group Actions
Publicly Verifiable Non-Interactive Zero-Knowledge Proofs
Threshold Ring Signatures and Applications to Ad-hoc Groups
Practical-Time Related-Key Attack on GOST with Secret S-Boxes
An Attack on a Signature Scheme Proposed by Okamoto and Shiraishi
Pseudorandom Knapsacks and the Sample Complexity of LWE Search-to-Decision Reductions
Oblivious RAM Revisited
Flood and Submerse: Distributed Key Generation and Robust Threshold Signature from Lattices
Advances in Cryptology - CRYPTO 2022 - 42nd Annual International Cryptology Conference, CRYPTO 2022, Santa Barbara, CA, USA, August 15-18, 2022, Proceedings, Part I
Security in the Presence of Key Reuse: Context-Separable Interfaces and Their Applications
Cryptographic Sensing
Speeding Up Secret Computations with Insecure Auxiliary Devices
Low Overhead Broadcast Encryption from Multilinear Maps
The Prevalence of Kleptographic Attacks on Discrete-Log Based Cryptosystems
A Framework for Practical Anonymous Credentials from Lattices
Round-Optimal Black-Box MPC in the Plain Model
On Computationally Secure Authentication Tags Requiring Short Secret Shared Keys
Short Chosen-Prefix Collisions for MD5 and the Creation of a Rogue CA Certificate
Optimal Perfectly Secure Message Transmission
Game-Theoretic Fairness Meets Multi-party Protocols: The Case of Leader Election
The Order of Encryption and Authentication for Protecting Communications (or: How Secure Is SSL?)
Highway to Hull: An Algorithm for Solving the General Matrix Code Equivalence Problem
Targeted Lossy Functions and Applications
Amortization with Fewer Equations for Proving Knowledge of Small Secrets
Extended Tower Number Field Sieve: A New Complexity for the Medium Prime Case
Private Computation - k-Connected versus 1-Connected Networks
Bloom Filters in Adversarial Environments
On Time-Space Tradeoffs for Bounded-Length Collisions in Merkle-Damgård Hashing
Constrained PRFs for \mathrmNC^1 in Traditional Groups
Fully Secure Attribute-Based Encryption for t-CNF from LWE
Secure Integration of Asymmetric and Symmetric Encryption Schemes
On Memory-Bound Functions for Fighting Spam
Non-Malleable Codes for Partial Functions with Manipulation Detection
Fast Computation of Discrete Logarithms in GF(q)
Inverting HFE Is Quasipolynomial
Non-interactive Zero-Knowledge from LPN and MQ
Counterexamples to New Circular Security Assumptions Underlying iO
Multimodal Private Signatures
Secure Distributed Linear Algebra in a Constant Number of Rounds
Cryptanalysis of Algebraic Verifiable Delay Functions
Practical Cryptanalysis of SFLASH
The Committing Security of MACs with Applications to Generic Composition
Quantum Linear Key-Recovery Attacks Using the QFT
Batch RSA
Pitfalls in Designing Substitution Boxes (Extended Abstract)
On the Impossibility of Algebraic NIZK in Pairing-Free Groups
Software Protection: Myth or Reality?
Linear Algebra with Sub-linear Zero-Knowledge Arguments
On the Factorization of RSA-120
Attribute Based Encryption for Turing Machines from Lattices
Polynomial Commitments for Galois Rings and Applications to SNARKs Over $\mathbb {Z}_{2^k}$
Client-Server Concurrent Zero Knowledge with Constant Rounds and Guaranteed Complexity
Robustness Principles for Public Key Protocols
On the Concrete Complexity of Zero-Knowledge Proofs
On Constructing Locally Computable Extractors and Cryptosystems in the Bounded Storage Model
New Approaches for Estimating the Bias of Differential-Linear Distinguishers
Advances in Cryptology - CRYPTO 2025 - 45th Annual International Cryptology Conference, Santa Barbara, CA, USA, August 17-21, 2025, Proceedings, Part IV
Adaptive Versus Non-Adaptive Strategies in the Quantum Setting with Applications
Collusion-Secure Fingerprinting for Digital Data (Extended Abstract)
Boosting Authenticated Encryption Robustness with Minimal Modifications
Password-Authenticated Session-Key Generation on the Internet in the Plain Model
Fine-Grained Non-interactive Key Exchange, Revisited
Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1
A Pseudo-Random Bit Generator Based on Elliptic Logarithms
Linear-Communication Asynchronous Complete Secret Sharing with Optimal Resilience
Adaptive Extractors and Their Application to Leakage Resilient Secret Sharing
Cut-and-Choose Yao-Based Secure Computation in the Online/Offline and Batch Settings
Random Selection with an Adversarial Majority
A Complete Security Proof of SQIsign
Subtractive Encryptors - Alternatives to the DES
Interactive Proofs under Continual Memory Leakage
Quantum Cryptography and Meta-Complexity
Message Franking via Committing Authenticated Encryption
Practical Product Proofs for Lattice Commitments
Advances in Cryptology - CRYPTO 2015 - 35th Annual Cryptology Conference, Santa Barbara, CA, USA, August 16-20, 2015, Proceedings, Part I
XOR MACs: New Methods for Message Authentication Using Finite Pseudorandom Functions
Provable Security of (Tweakable) Block Ciphers Based on Substitution-Permutation Networks
Use of Elliptic Curves in Cryptography
Information-Theoretic Security with Asymmetries
Polynomial Spaces: A New Framework for Composite-to-Prime-Order Transformations
Non-malleable Secret Sharing Against Bounded Joint-Tampering Attacks in the Plain Model
Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part II
A Note on the Round-Complexity of Concurrent Zero-Knowledge
Combinatorial Characterizations of Authentication Codes
An Identity-Based Signature Scheme with Bounded Life-Span
Structural Lower Bounds on Black-Box Constructions of Pseudorandom Functions
All Bits ax+b mod p are Hard (Extended Abstract)
Primality Proving via One Round in ECPP and One Iteration in AKS
Efficient Algorithms for Pairing-Based Cryptosystems
On the Function Field Sieve and the Impact of Higher Splitting Probabilities - Application to Discrete Logarithms in and
Bingo: Adaptivity and Asynchrony in Verifiable Secret Sharing and Distributed Key Generation
Secure Multiparty Computation from Threshold Encryption Based on Class Groups
Server-Aided Anonymous Credentials
Secure and Efficient Asynchronous Broadcast Protocols
Key-Evolution Schemes Resilient to Space-Bounded Leakage
Divergence Bounds on Key Equivocation and Error Probability in Cryptanalysis
On the F-function of FEAL
Achieving the Limits of the Noisy-Storage Model Using Entanglement Sampling
PKE and ABE with Collusion-Resistant Secure Key Leasing
Batch Binary Edwards
Cryptographic Randomness from Air Turbulence in Disk Drives
On the Possibility of Basing Cryptography on EXP≠ BPP
Secret Sharing Made Short
CSI -Otter: Isogeny-Based (Partially) Blind Signatures from the Class Group Action with a Twist
Cryptanalysis of MinRank
Threshold Schemes with Disenrollment
Generic Attacks Against Beyond-Birthday-Bound MACs
Information Theoretically Secure Communication in the Limited Storage Space Model
Efficient Algorithms for Supersingular Isogeny Diffie-Hellman
Annihilation Attacks for Multilinear Maps: Cryptanalysis of Indistinguishability Obfuscation over GGH13
A Rational Protocol Treatment of 51% Attacks
Designated Confirmer Signatures and Public-Key Encryption are Equivalent
Lattice Signatures and Bimodal Gaussians
Nearly Optimal Robust Secret Sharing Against Rushing Adversaries
Secure Multiparty Computation with Identifiable Abort via Vindicating Release
Dynamic Threshold Scheme Based on the Definition of Cross-Product in an N-Dimentional Linear Space
Fuming Acid and Cryptanalysis: Handy Tools for Overcoming a Digital Locking and Access Control System
Multi-Theorem Preprocessing NIZKs from Lattices
Security and Performance of Server-Aided RSA Computation Protocols
Advances in Cryptology, Proceedings of CRYPTO '83, Santa Barbara, California, USA, August 21-24, 1983
Unifying Computational Entropies via Kullback-Leibler Divergence
New Efficient Attacks on Statistical Disclosure Control Mechanisms
Loquat: A SNARK-Friendly Post-quantum Signature Based on the Legendre PRF with Applications in Ring and Aggregate Signatures
Full Key-Recovery Attacks on HMAC/NMAC-MD4 and NMAC-MD5
The Curious Case of Non-Interactive Commitments - On the Power of Black-Box vs. Non-Black-Box Use of Primitives
Two Observations on Probabilistic Primality Testing
Distributed Private Data Analysis: Simultaneously Solving How and What
On the Distribution of Characteristics in Composite Permutations
Merkle Puzzles Are Optimal - An O ( n 2 )-Query Attack on Any Key Exchange from a Random Oracle
Edit Distance Correlation Attack on the Alternating Step Generator
A New Identification Scheme Based on Syndrome Decoding
Block-Cipher-Based Tree Hashing
Revisiting Differential-Linear Attacks via a Boomerang Perspective with Application to AES, Ascon, CLEFIA, SKINNY, PRESENT, KNOT, TWINE, WARP, LBlock, Simeck, and SERPENT
Noninteractive Zero Knowledge for NP from (Plain) Learning with Errors
Perfectly-Secure Multiplication for Any t < n /3
GQ and Schnorr Identification Schemes: Proofs of Security against Impersonation under Active and Concurrent Attacks
Which E-Voting Problems Do We Need to Solve?
Programmable Hash Functions from Lattices: Short Signatures and IBEs with Small Key Sizes
Lattice-Based Authenticated Key Exchange with Tight Security
On the Amortized Complexity of Zero-Knowledge Protocols
Faster Modular Multiplication by Operand Scaling
Doubly Efficient Cryptography: Commitments, Arguments and RAM MPC
Impossibility Results for Static Input Secure Computation
Oblivious Transfer in the Bounded Storage Model
A Family of Jacobians Suitable for Discrete Log Cryptosystems
Simplifying Game-Based Definitions - Indistinguishability up to Correctness and Its Application to Stateful AE
Authentication, Enhanced Security and Error Correcting Codes (Extended Abstract)
Efficient Constant Round Multi-party Computation Combining BMR and SPDZ
Design of Elliptic Curves with Controllable Lower Boundary of Extension Degree for Reduction Attacks
Cryptanalyses of Branching Program Obfuscations over GGH13 Multilinear Map from the NTRU Problem
Cryptanalysis via Algebraic Spans
Polymath: Groth16 Is Not the Limit
Security Analysis and Improvements for the IETF MLS Standard for Group Messaging
Using Data Uncertainty to Increase the Crypto-Complexity of Simple Private Key Enciphering Schemes
Computing Asymptotic Bounds for Small Roots in Coppersmith's Method via Sumset Theory
On the Security of TLS-DHE in the Standard Model
A Universal Statistical Test for Random Bit Generators
Structure-Preserving Signatures from Type II Pairings
New Techniques for SPHFs and Efficient One-Round PAKE Protocols
An Enciphering Scheme Based on a Card Shuffle
Middle-Product Learning with Errors
Advances in Cryptology - CRYPTO 2023 - 43rd Annual International Cryptology Conference, CRYPTO 2023, Santa Barbara, CA, USA, August 20-24, 2023, Proceedings, Part V
Strong Asymmetric PAKE Based on Trapdoor CKEM
Linear VSS and Distributed Commitments Based on Secret Sharing and Pairwise Checks
How to Construct Pseudo-Random Permutations from Pseudo-Random Functions (Abstract)
A Hybrid Lattice-Reduction and Meet-in-the-Middle Attack Against NTRU
Fair Computation of General Functions in Presence of Immoral Majority
Bug Attacks
Field-Agnostic SNARKs from Expand-Accumulate Codes
Watermarking Cryptographic Functionalities from Standard Lattice Assumptions
PAC Privacy: Automatic Privacy Measurement and Control of Data Processing
Witness Authenticating NIZKs and Applications
On Gaussian Sampling for q-ary Lattices and Linear Codes with Lee Weight
Identity-Based Encryption from the Weil Pairing
Advances in Cryptology - CRYPTO '94, 14th Annual International Cryptology Conference, Santa Barbara, California, USA, August 21-25, 1994, Proceedings
Indifferentiable Authenticated Encryption
Anonymous Hierarchical Identity-Based Encryption (Without Random Oracles)
Improved Security Analyses for CBC MACs
On the Structure of Secret Key Exchange Protocols
Strong Secret Sharing with Snitching
Breaking the Circuit Size Barrier for Secure Computation Under DDH
Statistical Zeroizing Attack: Cryptanalysis of Candidates of BP Obfuscation over GGH15 Multilinear Map
Secure Identity-Based Encryption in the Quantum Random Oracle Model
Luby-Rackoff: 7 Rounds Are Enough for 2 n(1-epsilon) Security