#### Filter Results:

- Full text PDF available (12)

#### Publication Year

2003

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (3)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Dan Boneh, Xavier Boyen, Eu-Jin Goh
- EUROCRYPT
- 2005

We present a Hierarchical Identity Based Encryption (HIBE) system where the ciphertext consists of just three group elements and decryption requires only two bilinear map computations, regardless of the hierarchy depth. Encryption is as efficient as in other HIBE systems. We prove that the scheme is selective-ID secure in the standard model and fully secure… (More)

- Dan Boneh, Eu-Jin Goh, Kobbi Nissim
- TCC
- 2005

Let ψ be a 2-DNF formula on boolean variables x1, . . . , xn ∈ {0, 1}. We present a homomorphic public key encryption scheme that allows the public evaluation of ψ given an encryption of the variables x1, . . . , xn. In other words, given the encryption of the bits x1, . . . , xn, anyone can create the encryption of ψ(x1, . . . , xn). More generally, we can… (More)

- Hovav Shacham, Matthew Page, Ben Pfaff, Eu-Jin Goh, Nagendra Modadugu, Dan Boneh
- ACM Conference on Computer and Communications…
- 2004

Address-space randomization is a technique used to fortify systems against buffer overflow attacks. The idea is to introduce artificial diversity by randomizing the memory location of certain system components. This mechanism is available for both Linux (via PaX ASLR) and OpenBSD. We study the effectiveness of address-space randomization and find that its… (More)

- Eu-Jin Goh
- IACR Cryptology ePrint Archive
- 2003

A secure index is a data structure that allows a querier with a “trapdoor” for a word x to test in O(1) time only if the index contains x; The index reveals no information about its contents without valid trapdoors, and trapdoors can only be generated with a secret key. Secure indexes are a natural extension of the problem of constructing data structures… (More)

- Eu-Jin Goh, Hovav Shacham, Nagendra Modadugu, Dan Boneh
- NDSS
- 2003

This paper presents SiRiUS, a secure file system designed to be layered over insecure network and P2P file systems such as NFS, CIFS, OceanStore, and Yahoo! Briefcase. SiRiUS assumes the network storage is untrusted and provides its own read-write cryptographic access control for file level sharing. Key management and revocation is simple with minimal… (More)

- Eu-Jin Goh, Stanislaw Jarecki
- EUROCRYPT
- 2003

We show a signature scheme whose security is tightly related to the Computational Diffie-Hellman (CDH) assumption in the Random Oracle Model. Existing discrete-log based signature schemes, such as ElGamal, DSS, and Schnorr signatures, either require non-standard assumptions, or their security is only loosely related to the discrete logarithm (DL) assumption… (More)

- Louis Kruger, Somesh Jha, Eu-Jin Goh, Dan Boneh
- ACM Conference on Computer and Communications…
- 2006

Privacy-preserving protocols allow multiple parties with private inputs to perform joint computation while preserving the privacy of their respective inputs. An important cryptographic primitive for designing privacy-preserving protocols is secure function evaluation (SFE). The classic solution for SFE by Yao uses a gate representation of the function that… (More)

- Eu-Jin Goh, Stanislaw Jarecki, Jonathan Katz, Nan Wang
- Journal of Cryptology
- 2007

We propose and analyze two efficient signature schemes whose security is tightly related to the Diffie-Hellman problems in the random oracle model. The security of our first scheme relies on the hardness of the computational Diffie-Hellman problem; the security of our second scheme - which is more efficient than the first-is based on the hardness of the… (More)

- Eu-Jin Goh, Tan Poh Tee
- 2007

Encryption schemes are designed to provide data confidentiality and are a fundamental cryptographic primitive with many applications in higher-level protocols. Groups with a bilinear map allow us to build public key encryption schemes with new properties that are otherwise difficult to obtain using groups without a bilinear map. We support our thesis by… (More)

- Daniel V. Bailey, Dan Boneh, Eu-Jin Goh, Ari Juels
- ACM Conference on Computer and Communications…
- 2007

We examine covert channels in privacy-enhanced mobile identification devices where the devices uniquely identify themselves to an authorized verifier. Such devices (e.g. RFID tags) are increasingly commonplace in hospitals and many other environments. For privacy, the device outputs used for identification should "appear random" to any entity other than the… (More)