CRYPTO 2010 - PDF Preprint Papers

CRYPTO 2010 Advances in Cryptology

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed CRYPTO-2010 Paper

click to vote

CRYPTO
2010
Springer

228views Cryptology» more CRYPTO 2010»

On Generalized Feistel Networks

13 years 5 months ago

Download eprint.iacr.org

We prove beyond-birthday-bound security for most of the well-known types of generalized Feistel networks: (1) unbalanced Feistel networks, where the n-bit to m-bit round functions ...

Viet Tung Hoang, Phillip Rogaway

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	228	On Generalized Feistel Networks	claim
2	208	Improved Delegation of Computation Using Fully Homomorphic Encryption	claim
3	201	Protecting Cryptographic Keys against Continual Leakage	claim
4	197	Lattice Basis Delegation in Fixed Dimension and Shorter-Ciphertext Hierarchical IBE	claim
5	195	Fully Secure Functional Encryption with General Relations from the Decisional Linear Assumption	claim
6	189	Instantiability of RSA-OAEP under Chosen-Plaintext Attack	claim
7	188	i-Hop Homomorphic Encryption and Rerandomizable Yao Circuits	claim
8	188	Efficient Indifferentiable Hashing into Ordinary Elliptic Curves	claim
9	186	Additively Homomorphic Encryption with d-Operand Multiplications	claim
10	181	On the Efficiency of Classical and Quantum Oblivious Transfer Reductions	claim
11	171	Credential Authenticated Identification and Key Exchange	claim
12	170	Securing Computation against Continuous Leakage	claim
13	167	Multiparty Computation for Dishonest Majority: From Passive to Active Security at Low Cost	claim
14	162	On Strong Simulation and Composable Point Obfuscation	claim
15	158	Interactive Locking, Zero-Knowledge PCPs, and Unconditional Cryptography	claim
16	157	Oblivious RAM Revisited	claim
17	157	Correcting Errors in RSA Private Keys	claim
18	157	Circular and Leakage Resilient Public-Key Encryption under Subgroup Indistinguishability - (or: Quadratic Residuosity Strikes Back)	claim
19	151	Leakage-Resilient Pseudorandom Functions and Side-Channel Attacks on Feistel Networks	claim
20	145	Protocols for Multiparty Coin Toss with Dishonest Majority	claim
21	144	Structure-Preserving Signatures and Commitments to Group Elements	claim
22	141	Factorization of a 768-Bit RSA Modulus	claim
23	140	Password-Authenticated Session-Key Generation on the Internet in the Plain Model	claim
24	139	Concurrent Non-Malleable Zero Knowledge Proofs	claim
25	132	Cryptographic Extraction and Key Derivation: The HKDF Scheme	claim
26	121	Time Space Tradeoffs for Attacks against One-Way Functions and PRGs	claim
27	120	Pseudorandom Functions and Permutations Provably Secure against Related-Key Attacks	claim
28	110	An Efficient and Parallel Gaussian Sampler for Lattices	claim
29	109	Non-interactive Verifiable Computing: Outsourcing Computation to Untrusted Workers	claim
30	109	Equivalence of Uniform Key Agreement and Composition Insecurity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers