EUROCRYPT 1999 - PDF Preprint Papers

EUROCRYPT 1999 Int. Workshop/Conference on Theory and Application of

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed EUROCRYPT-1999 Paper

click to vote

EUROCRYPT
1999
Springer

233views Cryptology» more EUROCRYPT 1999»

Public-Key Cryptosystems Based on Composite Degree Residuosity Classes

14 years 4 months ago

Download www.gemplus.com

Abstract. This paper investigates a novel computational problem, namely the Composite Residuosity Class Problem, and its applications to public-key cryptography. We propose a new t...

Pascal Paillier

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	233	Public-Key Cryptosystems Based on Composite Degree Residuosity Classes	claim
2	182	New Public Key Cryptosystems Based on the Dependent-RSA Problems	claim
3	156	Computationally Private Information Retrieval with Polylogarithmic Communication	claim
4	148	Secure Hash-and-Sign Signatures Without the Random Oracle	claim
5	140	On the Performance of Hyperelliptic Cryptosystems	claim
6	136	On the Concurrent Composition of Zero-Knowledge Proofs	claim
7	135	An Analysis of Exponentiation Based on Formal Languages	claim
8	132	On the (Im)possibility of Basing Oblivious Transfer and Bit Commitment on Weakened Security Assumptions	claim
9	129	Secure Distributed Key Generation for Discrete-Log Based Cryptosystems	claim
10	127	Proving in Zero-Knowledge that a Number Is the Product of Two Safe Primes	claim
11	126	A Note on the Limits of Collusion-Resistant Watermarks	claim
12	117	Comparing the MOV and FR Reductions in Elliptic Curve Cryptography	claim
13	113	Cryptanalysis of Skipjack Reduced to 31 Rounds Using Impossible Differentials	claim
14	111	Conditional Oblivious Transfer and Timed-Release Encryption	claim
15	109	Lower Bounds for Oblivious Transfer Reductions	claim
16	109	Secure Communication in Broadcast Channels: The Answer to Franklin and Wright's Question	claim
17	107	Software Performance of Universal Hash Functions	claim
18	107	Coin-Based Anonymous Fingerprinting	claim
19	98	Improved Fast Correlation Attacks on Stream Ciphers via Convolutional Codes	claim
20	92	Distributed Pseudo-random Functions and KDCs	claim
21	85	S-boxes with Controllable Nonlinearity	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers