What a lovely hat
Is it made out of
tin foil
?
International Association for Cryptologic Research
International Association
for Cryptologic Research
IACR
Events
All IACR events
Asiacrypt
Crypto
Eurocrypt
CHES
FSE
PKC
TCC
RWC
Cryptology Schools
In cooperation with IACR
Publications
All IACR Publications
Journal of Cryptology
Transactions on Symmetric Cryptology
Transactions on CHES
Communications in Cryptology
Cryptology ePrint Archive
Artifact Archive
Access IACR Publications
Museum of Historic Papers
Publication Statistics
News
All News
Awards
Elections
Petitions & Statements
Services
Jobs
CryptoDB
Calendar of Events
Videos
Members
How to Join
Update Membership Information
Access IACR Publications
Subscribe to News Updates
About
About IACR
Board of Directors
Committees
Documents
Privacy Policy
Suggestions from
local search
as you type. Hit enter to search with Google.
Search
Suggestions from
local search
as you type. Hit enter to search with Google.
CryptoDB
General
About CryptoDB
Report errors
Publications
Awards
Invited talks/papers
By year
By venue
With video
Acceptance rates
BibTeX
People
Most publications
Coauthor statistics
All Program committees
Most Program committees
Benny Chor
Publications
Year
Venue
Title
1995
CRYPTO
Secret Sharing with Public Reconstruction (Extended Abstract)
Amos Beimel
Benny Chor
1994
CRYPTO
Tracing Traitors
Benny Chor
Amos Fiat
Moni Naor
1994
JOFC
On the Structure of the Privacy Hierarchy
Benny Chor
Mihály Geréb-Graus
Eyal Kushilevitz
1993
CRYPTO
Interaction in Key Distribution Schemes (Extended Abstract)
Amos Beimel
Benny Chor
1993
JOFC
Secret Sharing Over Infinite Domains
Benny Chor
Eyal Kushilevitz
1992
CRYPTO
Universally Ideal Secret Sharing Schemes (Preliminary Version)
Amos Beimel
Benny Chor
1989
CRYPTO
Secret Sharing Over Infinite Domains (Extended Abstract)
Benny Chor
Eyal Kushilevitz
1985
CRYPTO
The Bit Security of Modular Squaring Given Partial Factorization of the Modulos
Benny Chor
Oded Goldreich
Shafi Goldwasser
1984
CRYPTO
A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields
Benny Chor
Ronald L. Rivest
1984
CRYPTO
RSA/Rabin Least Significant Bits are 1/2 + 1/(poly(log N)) Secure
Benny Chor
Oded Goldreich
Coauthors
Amos Beimel
(3)
Amos Fiat
(1)
Mihály Geréb-Graus
(1)
Oded Goldreich
(2)
Shafi Goldwasser
(1)
Eyal Kushilevitz
(3)
Moni Naor
(1)
Ronald L. Rivest
(1)