Two Papers on Indistinguishability Obfuscation - Soft Merge
Explore cutting-edge cryptographic research on indistinguishability obfuscation, examining two papers from Crypto 2017 that utilize novel techniques like linear maps and locality-based PRGs.
Incremental Program Obfuscation
Explore incremental program obfuscation techniques, their properties, security implications, and positive outcomes in cryptography and computer science.
Identity Based Encryption from the Diffie Hellman Assumption
Explore identity-based encryption, chameleon hashing, and garbled circuits in cryptography. Learn about innovative techniques and their applications in secure communication systems.
Breaking the FF3 Format Preserving Encryption Standard Over Small Domains
Cryptographic analysis of FF3 Format Preserving Encryption, revealing vulnerabilities in small domain implementations and proposing potential attacks.
Compact Structure Preserving Signatures with Almost Tight Security
Explore structure-preserving signatures with tight security, their design principles, and applications in cryptography. Learn about proof techniques and implications for secure systems.
Encrypted Davies Meyer and Its Dual - Towards Optimal Security Using Mirror Theory
Explore innovative cryptographic constructions using mirror theory to achieve optimal security in block cipher designs and hash functions.
Fast Secure Two Party ECDSA Signing
Explore fast, secure two-party ECDSA signing with Yehuda Lindell's presentation, covering comparisons, rewriting techniques, demonstrations, and key generation.
Encryption Switching Protocols Revisited - Switching Modulo P
Explore advanced cryptographic techniques for encryption switching protocols, focusing on modulo p operations and their implications for secure data transmission.
Conditional Disclosure of Secrets - Amplification, Closure, Amortization, Lower Bounds, and Separation
Explore advanced cryptography concepts like conditional disclosure, amplification, and amortization. Delve into lower bounds, separation, and privacy errors in this theoretical research presentation.
Four Round Concurrent Non Malleable Commitments from One Way Functions
Explore advanced cryptographic techniques for secure commitments using one-way functions, focusing on concurrent non-malleability in just four rounds.
From Obfuscation to the Security of Fiat Shamir for Proofs
Explore the security of Fiat-Shamir for proofs, examining obfuscation, negative results, strong assumptions, and correlation intractable hash functions in cryptography.
Distinguisher Dependent Simulation in Two Rounds and Its Applications
Explore innovative cryptographic techniques for two-round distinguisher-dependent simulation and their practical applications in secure systems.
Functional Graph Revisited - Updates on Second Preimage Attacks on Hash Combiners
Explore updates on second preimage attacks on hash combiners, focusing on functional graph analysis and its implications for cryptographic security.
Gaussian Sampling over the Integers - Efficient, Generic, Constant Time
Explore efficient, generic, and constant-time techniques for Gaussian sampling over integers, as presented in a cryptography research paper at Crypto 2017.
Identity Based Encryption from Codes with Rank Metric
Explore innovative cryptographic techniques using rank metric codes for identity-based encryption, enhancing security and efficiency in modern communication systems.
Generic Transformations of Predicate Encodings - Constructions and Applications
Explore generic transformations of predicate encodings, their constructions, and applications in cryptography. Gain insights into advanced cryptographic techniques and their implications.
Hedging Public Key Encryption in the Real World
Explore real-world hedging techniques for public key encryption, focusing on OpenSSL implementation, coin sources, API design, and security models in cryptography.
Boosting Authenticated Encryption Robustness With Minimal Modifications
Explore authenticated encryption robustness, focusing on minimal modifications to enhance security. Learn about GCM deployment, algorithm exploitation, and resistance against various attacks.
Black Box Parallel Garbled RAM
Explore parallel garbled RAM for secure encrypted data computation, covering oblivious RAM, circuit logic, and simulation techniques in cryptography.
Be Adaptive, Avoid Overcommitting
Explore adaptive cryptographic techniques to enhance security without overcommitting resources. Learn strategies for efficient and flexible cryptographic implementations.
Amortization with Fewer Equations for Proving Knowledge of Small Secrets
Explore innovative techniques for proving knowledge of small secrets using amortization with fewer equations, enhancing efficiency in zero-knowledge proofs and cryptographic protocols.