Travelled to:
1 × Finland
1 × Iceland
1 × Israel
1 × Italy
10 × USA
Collaborated with:
∅ U.Feige C.Schnorr J.J.Hoch A.W.Schrift J.Håstad R.L.Rivest W.W.Wadge Z.Manna A.Fiat H.Ong M.Ben-Or B.Chor D.Feldman R.Impagliazzo M.Naor N.Nisan S.Rudich
Talks about:
cryptograph (3) generat (3) random (2) comput (2) secur (2) optim (2) hash (2) wit (2) indistinguish (1) cryptocomplex (1)
Person: Adi Shamir
DBLP: Shamir:Adi
Contributed to:
Wrote 16 papers:
- ICALP-C-2008-HochS #on the
- On the Strength of the Concatenated Hash Combiner When All the Hash Functions Are Weak (JJH, AS), pp. 616–630.
- STOC-1993-Shamir #generative #multi #on the
- On the generation of multivariate polynomials which are hard to factor (AS), pp. 796–804.
- STOC-1990-FeigeS #protocol
- Witness Indistinguishable and Witness Hiding Protocols (UF, AS), pp. 416–426.
- STOC-1990-SchriftS
- The Discrete Log is Very Discreet (AWS, AS), pp. 405–415.
- ICALP-1989-FeldmanINNRS #generative #modelling #on the #random
- On Dice and Coins: Models of Computation for Random Generation (DF, RI, MN, NN, SR, AS), pp. 319–340.
- STOC-1987-FeigeFS #proving
- Zero Knowledge Proofs of Identity (UF, AF, AS), pp. 210–217.
- STOC-1986-SchnorrS #algorithm #sorting
- An Optimal Sorting Algorithm for Mesh Connected Computers (CPS, AS), pp. 255–263.
- STOC-1985-HastadS #encryption #security
- The Cryptographic Security of Truncated Linearly Related Variables (JH, AS), pp. 356–362.
- STOC-1984-OngSS #equation #performance #polynomial
- An Efficient Signature Scheme Based on Quadratic Equations (HO, CPS, AS), pp. 208–216.
- STOC-1983-Ben-OrCS #encryption #on the #security
- On the Cryptographic Security of Single RSA Bits (MBO, BC, AS), pp. 421–430.
- STOC-1982-RivestS #how #memory management #reuse
- How to Reuse a “Write-Once” Memory (RLR, AS), pp. 105–113.
- ICALP-1981-Shamir #encryption #generative #on the #pseudo #sequence
- On the Generation of Cryptographically Strong Pseudo-Random Sequences (AS), pp. 544–550.
- ICALP-1980-Shamir #commutative #encryption #on the #power of
- On the Power of Commutativity in Cryptography (AS), pp. 582–595.
- STOC-1979-Shamir #complexity #on the
- On the Cryptocomplexity of Knapsack Systems (AS), pp. 118–129.
- ICALP-1977-ShamirW #data type
- Data Types as Objects (AS, WWW), pp. 465–479.
- STOC-1975-MannaS #recursion #source code
- The Optimal Fixedpoint of Recursive Programs (ZM, AS), pp. 194–206.