20:45

Simple and Efficient Public-Key Encryption from Computational Diffie-Hellman in the Standard Model.

IACR

19:32

Constant Size Ciphertexts in Threshold Attribute-Based Encryption.

IACR

21:30

Algebraic Cryptanalysis of the PKC'2009 Algebraic Surface Cryptosystem.

IACR

22:44

Maximizing Small Root Bounds by Linearization and Applications to Small Secret Exponent RSA.

IACR

22:31

On the Feasibility of Consistent Computations.

IACR

29:58

Secure Network Coding over the Integers.

IACR

25:49

Preventing Pollution Attacks in Multi-source Network Coding.

IACR

20:19

Constant-Round Concurrent Non-Malleable Statistically Binding Commitments and Decommitments.

IACR

23:35

Faster Squaring in the Cyclotomic Subgroup of Sixth Degree Extensions.

IACR

26:05

Faster Pairing Computations on Curves with High-Degree Twists.

IACR

19:41

Efficient Arithmetic on Hessian Curves.

IACR

17:29

CCA Proxy Re-Encryption without Bilinear Maps in the Standard Model.

IACR

19:16

More Constructions of Lossy and Correlation-Secure Trapdoor Functions.

IACR

24:26

Chosen-Ciphertext Security from Slightly Lossy Trapdoor Functions.

IACR

1:02:45

Duality in Lattice Based Cryptography

IACR

22:16

Efficient Set Operations in the Presence of Malicious Adversaries.

IACR

21:45

Text Search Protocols with Simulation Based Security.

IACR

18:10

Solving a 676-Bit Discrete Logarithm Problem in GF(3^6n).

IACR

21:05

Using Equivalence Classes to Accelerate Solving the Discrete Logarithm Problem in a Short Interval.

IACR

26:48

Functional Encryption for Inner Product: Achieving Const ...

IACR

21:54

Security of Encryption Schemes in Weakened Random Oracle Models.

IACR

23:43

Fully Homomorphic Encryption with Relatively Small Key and Ciphertext Sizes.

IACR

15:50

Confidential Signatures and Deterministic Signcryption.

IACR

26:19

Identity-Based Aggregate and Multi-Signature Schemes Based on RSA.

IACR